- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c15 |      | Eric Bareke, Jean-François Spinella, Ramon Vidal, Jasmine Healy, Daniel Sinnett, Miklós Csürös: A novel mathematical basis for predicting somatic single nucleotide variants from next-generation sequencing. BCB 2012: 533-535 |
| 2011 | ||
| j8 | | Miklós Csürös, Igor B. Rogozin, Eugene V. Koonin: A Detailed History of Intron-rich Eukaryotic Ancestors Inferred from a Global Survey of 100 Complete Genomes. PLoS Computational Biology 7(9) (2011) |
| 2010 | ||
| c14 | | |
| c13 | | Miklós Csürös, Szilveszter Juhos, Attila Bérces: Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA. WABI 2010: 176-188 |
| 2009 | ||
| i3 | | |
| 2008 | ||
| j7 | | Miklós Csürös: Malin: maximum likelihood analysis of intron evolution in eukaryotes. Bioinformatics 24(13): 1538-1539 (2008) |
| c12 | | Miklós Csürös: Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions. RECOMB-CG 2008: 72-86 |
| r1 | | Miklós Csürös: Distance-Based Phylogeny Reconstruction (Fast-Converging). Encyclopedia of Algorithms 2008 |
| 2007 | ||
| j6 | | Miklós Csürös, Bin Ma: Rapid Homology Search with Neighbor Seeds. Algorithmica 48(2): 187-202 (2007) |
| c11 | | Miklós Csürös, J. Andrew Holey, Igor B. Rogozin: In search of lost introns. ISMB/ECCB (Supplement of Bioinformatics) 2007: 87-96 |
| 2006 | ||
| j5 | | |
| c10 | | Miklós Csürös, István Miklós: A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer. RECOMB 2006: 206-220 |
| c9 | | Miklós Csürös, Ming-Te Cheng, Andreas Grimm, Amine Halawani, Perrine Landreau: Segmentation with an Isochore Distribution. WABI 2006: 388-399 |
| 2005 | ||
| c8 | | Miklós Csürös, Bin Ma: Rapid Homology Search with Two-Stage Extension and Daughter Seeds. COCOON 2005: 104-114 |
| c7 | | |
| i2 | | Miklós Csürös: A linear-time algorithm for finding the longest segment which scores above a given threshold. CoRR abs/cs/0512016 (2005) |
| 2004 | ||
| j4 | | Miklós Csürös, Aleksandar Milosavljevic: Pooled Genomic Indexing (PGI): Analysis and Design of Experiments. Journal of Computational Biology 11(5): 1001-1021 (2004) |
| j3 | | Miklós Csürös: Maximum-Scoring Segment Sets. IEEE/ACM Trans. Comput. Biology Bioinform. 1(4): 139-150 (2004) |
| c6 | | |
| c5 | | Miklós Csürös: Algorithms for Finding Maximal-Scoring Segment Sets (Extended Abstract). WABI 2004: 62-73 |
| 2002 | ||
| j2 | | Miklós Csürös: Fast Recovery of Evolutionary Trees with Thousands of Nodes. Journal of Computational Biology 9(2): 277-297 (2002) |
| c4 | | Miklós Csürös, Aleksandar Milosavljevic: Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design. WABI 2002: 10-28 |
| 2001 | ||
| j1 | | Miklós Csürös, Ming-Yang Kao: Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. SIAM J. Comput. 31(1): 306-322 (2001) |
| c3 | | |
| 2000 | ||
| i1 | | Miklós Csürös, Ming-Yang Kao: Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. CoRR cs.DS/0011038 (2000) |
| 1999 | ||
| c2 | | Miklós Csürös, Ming-Yang Kao: Recovering Evolutionary Trees Through Harmonic Greedy Triplets. SODA 1999: 261-270 |
| 1997 | ||
| c1 | | Dana Angluin, Miklós Csürös: Learning Markov Chains with Variable Memory Length from Noisy Output. COLT 1997: 298-308 |
Colors in the list of coauthors
Last update Sat May 25 09:01:43 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page