Year |
Citation |
Score |
2010 |
Chen X, Tompa M. Comparative assessment of methods for aligning multiple genome sequences. Nature Biotechnology. 28: 567-72. PMID 20495551 DOI: 10.1038/Nbt.1637 |
0.309 |
|
2009 |
Tseng HH, Tompa M. Algorithms for locating extremely conserved elements in multiple sequence alignments. Bmc Bioinformatics. 10: 432. PMID 20021665 DOI: 10.1186/1471-2105-10-432 |
0.318 |
|
2009 |
Prakash A, Tompa M. Assessing the discordance of multiple sequence alignments. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 6: 542-51. PMID 19875854 DOI: 10.1109/Tcbb.2007.70271 |
0.333 |
|
2009 |
Giacani L, Godornes C, Puray-Chavez M, Guerra-Giraldez C, Tompa M, Lukehart SA, Centurion-Lara A. TP0262 is a modulator of promoter activity of tpr Subfamily II genes of Treponema pallidum ssp. pallidum. Molecular Microbiology. 72: 1087-99. PMID 19432808 DOI: 10.1111/J.1365-2958.2009.06712.X |
0.31 |
|
2007 |
Wang AX, Ruzzo WL, Tompa M. How accurately is ncRNA aligned within whole-genome multiple alignments? Bmc Bioinformatics. 8: 417. PMID 17963514 DOI: 10.1186/1471-2105-8-417 |
0.313 |
|
2006 |
Neph S, Tompa M. MicroFootPrinter: a tool for phylogenetic footprinting in prokaryotic genomes. Nucleic Acids Research. 34: W366-8. PMID 16845027 DOI: 10.1093/Nar/Gkl069 |
0.33 |
|
2006 |
Li N, Tompa M. Analysis of computational approaches for motif discovery. Algorithms For Molecular Biology : Amb. 1: 8. PMID 16722558 DOI: 10.1186/1748-7188-1-8 |
0.33 |
|
2005 |
Prakash A, Tompa M. Discovery of regulatory elements in vertebrates through comparative genomics. Nature Biotechnology. 23: 1249-56. PMID 16211068 DOI: 10.1038/Nbt1140 |
0.321 |
|
2005 |
Tompa M, Li N, Bailey TL, Church GM, De Moor B, Eskin E, Favorov AV, Frith MC, Fu Y, Kent WJ, Makeev VJ, Mironov AA, Noble WS, Pavesi G, Pesole G, et al. Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology. 23: 137-44. PMID 15637633 DOI: 10.1038/Nbt1053 |
0.303 |
|
2004 |
Sinha S, Blanchette M, Tompa M. PhyME: a probabilistic algorithm for finding motifs in sets of orthologous sequences. Bmc Bioinformatics. 5: 170. PMID 15511292 DOI: 10.1186/1471-2105-5-170 |
0.386 |
|
2003 |
Blanchette M, Tompa M. FootPrinter: A program designed for phylogenetic footprinting. Nucleic Acids Research. 31: 3840-2. PMID 12824433 DOI: 10.1093/Nar/Gkg606 |
0.316 |
|
2003 |
Sinha S, Tompa M. YMF: A program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Research. 31: 3586-8. PMID 12824371 DOI: 10.1093/Nar/Gkg618 |
0.315 |
|
2002 |
Sinha S, Tompa M. Discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Research. 30: 5549-60. PMID 12490723 DOI: 10.1093/Nar/Gkf669 |
0.348 |
|
2002 |
Buhler J, Tompa M. Finding motifs using random projections. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 9: 225-42. PMID 12015879 DOI: 10.1089/10665270252935430 |
0.569 |
|
2002 |
Blanchette M, Schwikowski B, Tompa M. Algorithms for phylogenetic footprinting. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 9: 211-23. PMID 12015878 DOI: 10.1089/10665270252935421 |
0.388 |
|
2002 |
Blanchette M, Tompa M. Discovery of regulatory elements by a computational method for phylogenetic footprinting. Genome Research. 12: 739-48. PMID 11997340 DOI: 10.1101/Gr.6902 |
0.37 |
|
2001 |
Tompa M. Identifying functional elements by comparative DNA sequence analysis. Genome Research. 11: 1143-1144. PMID 11435394 DOI: 10.1101/Gr.197101 |
0.368 |
|
1996 |
Chinn DD, Leighton T, Tompa M. Minimal Adaptive Routing on the Mesh with Bounded Queue Size Journal of Parallel and Distributed Computing. 34: 154-170. DOI: 10.1006/Jpdc.1996.0052 |
0.315 |
|
1996 |
Beame P, Borodin A, Raghavan P, Ruzzo WL, Tompa M. Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata Information and Computation. 130: 101-129. DOI: 10.1006/Inco.1996.0085 |
0.323 |
|
1995 |
Buss J, Tompa M. Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five Information & Computation. 120: 326-329. DOI: 10.1006/Inco.1995.1117 |
0.304 |
|
1992 |
Tompa M. Lower bounds on universal traversal sequences for cycles and other low degree graphs Siam Journal On Computing. 21: 1153-1160. DOI: 10.1137/0221067 |
0.305 |
|
1989 |
Borodin A, Cook SA, Dymond PW, Ruzzo WL, Tompa M. Two Applications of Inductive Counting for Complementation Problems Siam Journal On Computing. 18: 559-578. DOI: 10.1137/0218038 |
0.367 |
|
1989 |
Coppersmith D, Raghavan P, Tompa M. Parallei graph algorithms that are efficient on average Information and Computation. 81: 318-333. DOI: 10.1016/0890-5401(89)90035-7 |
0.313 |
|
1984 |
Ruzzo WL, Simon J, Tompa M. Space-bounded hierarchies and probabilistic computations Journal of Computer and System Sciences. 28: 216-230. DOI: 10.1016/0022-0000(84)90066-7 |
0.309 |
|
1982 |
Tompa M. Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations Siam Journal On Computing. 11: 130-137. DOI: 10.1137/0211010 |
0.33 |
|
1981 |
Borodin A, Fischer MJ, Kirkpatrick DG, Lynch NA, Tompa M. A time-space tradeoff for sorting on non-oblivious machines☆ Journal of Computer and System Sciences. 22: 351-364. DOI: 10.1016/0022-0000(81)90037-4 |
0.322 |
|
1980 |
Tompa M. Time-space tradeoffs for computing functions, using connectivity properties of their circuits Journal of Computer and System Sciences. 20: 118-132. DOI: 10.1016/0022-0000(80)90056-2 |
0.315 |
|
Show low-probability matches. |