| 2009 |
|---|
| 22 | EE | Miklós Csürös:
Approximate counting with a floating-point counter
CoRR abs/0904.3062: (2009) |
| 2008 |
|---|
| 21 | EE | Miklós Csürös:
Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions.
RECOMB-CG 2008: 72-86 |
| 20 | EE | Miklós Csürös:
Distance-Based Phylogeny Reconstruction (Fast-Converging).
Encyclopedia of Algorithms 2008 |
| 19 | EE | Miklós Csürös:
Malin: maximum likelihood analysis of intron evolution in eukaryotes.
Bioinformatics 24(13): 1538-1539 (2008) |
| 2007 |
|---|
| 18 | EE | Miklós Csürös,
J. Andrew Holey,
Igor B. Rogozin:
In search of lost introns.
ISMB/ECCB (Supplement of Bioinformatics) 2007: 87-96 |
| 17 | EE | Miklós Csürös,
Bin Ma:
Rapid Homology Search with Neighbor Seeds.
Algorithmica 48(2): 187-202 (2007) |
| 2006 |
|---|
| 16 | EE | 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 |
| 15 | EE | Miklós Csürös,
Ming-Te Cheng,
Andreas Grimm,
Amine Halawani,
Perrine Landreau:
Segmentation with an Isochore Distribution.
WABI 2006: 388-399 |
| 2005 |
|---|
| 14 | EE | Miklós Csürös,
Bin Ma:
Rapid Homology Search with Two-Stage Extension and Daughter Seeds.
COCOON 2005: 104-114 |
| 13 | EE | Miklós Csürös:
Likely Scenarios of Intron Evolution.
Comparative Genomics 2005: 47-60 |
| 12 | EE | 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 |
|---|
| 11 | EE | Miklós Csürös:
Performing Local Similarity Searches with Variable Length Seeds.
CPM 2004: 373-387 |
| 10 | EE | Miklós Csürös:
Algorithms for Finding Maximal-Scoring Segment Sets (Extended Abstract).
WABI 2004: 62-73 |
| 9 | EE | Miklós Csürös:
Maximum-Scoring Segment Sets.
IEEE/ACM Trans. Comput. Biology Bioinform. 1(4): 139-150 (2004) |
| 8 | EE | 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) |
| 2002 |
|---|
| 7 | EE | Miklós Csürös,
Aleksandar Milosavljevic:
Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design.
WABI 2002: 10-28 |
| 6 | | Miklós Csürös:
Fast Recovery of Evolutionary Trees with Thousands of Nodes.
Journal of Computational Biology 9(2): 277-297 (2002) |
| 2001 |
|---|
| 5 | EE | Miklós Csürös:
Fast recovery of evolutionary trees with thousands of nodes.
RECOMB 2001: 104-113 |
| 4 | EE | 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) |
| 2000 |
|---|
| 3 | EE | 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 |
|---|
| 2 | EE | Miklós Csürös,
Ming-Yang Kao:
Recovering Evolutionary Trees Through Harmonic Greedy Triplets.
SODA 1999: 261-270 |
| 1997 |
|---|
| 1 | EE | Dana Angluin,
Miklós Csürös:
Learning Markov Chains with Variable Memory Length from Noisy Output.
COLT 1997: 298-308 |
