Learning Markov Chains with Variable Memory Length from Noisy Output. - Dana Angluin; Miklós Csürös (COLT, 1997)

Recovering Evolutionary Trees Through Harmonic Greedy Triplets. - Miklós Csürös; Ming-Yang Kao (SODA, 1999)

Fast recovery of evolutionary trees with thousands of nodes. - Miklós Csürös (RECOMB, 2001)

Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. - Miklós Csürös; Ming-Yang Kao (SIAM J. Comput., 2001)

Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design. - Miklós Csürös; Aleksandar Milosavljevic (WABI, 2002)

Performing Local Similarity Searches with Variable Length Seeds. - Miklós Csürös (CPM, 2004)

Single user tracing superimposed codes. - Miklós Csürös; Miklós Ruszinkó (ISIT, 2004)

Algorithms for Finding Maximal-Scoring Segment Sets (Extended Abstract). - Miklós Csürös (WABI, 2004)

Pooled Genomic Indexing (PGI): Analysis and Design of Experiments. - Miklós Csürös; Aleksandar Milosavljevic (J. Comput. Biol., 2004)

Maximum-Scoring Segment Sets. - Miklós Csürös (IEEE ACM Trans. Comput. Biol. Bioinform., 2004)

Rapid Homology Search with Two-Stage Extension and Daughter Seeds. - Miklós Csürös; Bin Ma 002 (COCOON, 2005)

Likely Scenarios of Intron Evolution. - Miklós Csürös (Comparative Genomics, 2005)

A linear-time algorithm for finding the longest segment which scores above a given threshold - Miklós Csürös (CoRR, 2005)

Single-user tracing and disjointly superimposed codes. - Miklós Csürös; Miklós Ruszinkó (IEEE Trans. Inf. Theory, 2005)

A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer. - Miklós Csürös; István Miklós (RECOMB, 2006)

Segmentation with an Isochore Distribution. - Miklós Csürös; Ming-Te Cheng; Andreas Grimm; Amine Halawani; Perrine Landreau (WABI, 2006)

On the Estimation of Intron Evolution. - Miklós Csürös (PLoS Comput. Biol., 2006)

In search of lost introns. - Miklós Csürös; J. Andrew Holey; Igor B. Rogozin (ISMB/ECCB (Supplement of Bioinformatics), 2007)

Rapid Homology Search with Neighbor Seeds. - Miklós Csürös; Bin Ma 002 (Algorithmica, 2007)

Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions. - Miklós Csürös (RECOMB-CG, 2008)

Malin: maximum likelihood analysis of intron evolution in eukaryotes. - Miklós Csürös (Bioinform., 2008)

Distance-Based Phylogeny Reconstruction (Fast-Converging). - Miklós Csürös (Encyclopedia of Algorithms, 2008)

Approximate Counting with a Floating-Point Counter. - Miklós Csürös (COCOON, 2010)

Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA. - Miklós Csürös; Szilveszter Juhos; Attila Bérces (WABI, 2010)

A Detailed History of Intron-rich Eukaryotic Ancestors Inferred from a Global Survey of 100 Complete Genomes. - Miklós Csürös; Igor B. Rogozin; Eugene V. Koonin (PLoS Comput. Biol., 2011)

A novel mathematical basis for predicting somatic single nucleotide variants from next-generation sequencing. - Eric Bareke; Jean-François Spinella; Ramon Vidal; Jasmine Healy; Daniel Sinnett; Miklós Csürös (BCB, 2012)

How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree. - Miklós Csürös (Models and Algorithms for Genome Evolution, 2013)

Joint genotype inference with germline and somatic mutations. - Eric Bareke; Virginie Saillour; Jean-François Spinella; Ramon Vidal; Jasmine Healy; Daniel Sinnett; Miklós Csürös (BMC Bioinform., 2013)

Distance-Based Phylogeny Reconstruction (Fast-Converging). - Miklós Csürös (Encyclopedia of Algorithms, 2016)

Gain-loss-duplication models on a phylogeny: exact algorithms for computing the likelihood and its gradient. - Miklós Csürös (CoRR, 2021)