Miklós Csürös

According to our database, Miklós Csürös authored at least 30 papers between 1997 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Gain-loss-duplication models on a phylogeny: exact algorithms for computing the likelihood and its gradient.

Miklós Csürös

CoRR, 2021

2016

Distance-Based Phylogeny Reconstruction (Fast-Converging).

Miklós Csürös

Encyclopedia of Algorithms, 2016

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

How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree.

Miklós Csürös

Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012

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

Proceedings of the ACM International Conference on Bioinformatics, 2012

2011

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

2010

Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA.

Miklós Csürös, Szilveszter Juhos, Attila Bérces

Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Approximate Counting with a Floating-Point Counter.

Miklós Csürös

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2008

Distance-Based Phylogeny Reconstruction (Fast-Converging).

Miklós Csürös

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Malin: maximum likelihood analysis of intron evolution in eukaryotes.

Miklós Csürös

Bioinform., 2008

Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions.

Miklós Csürös

Proceedings of the Comparative Genomics, International Workshop, 2008

2007

Rapid Homology Search with Neighbor Seeds.

Miklós Csürös, Bin Ma

Algorithmica, 2007

In search of lost introns.

Miklós Csürös, J. Andrew Holey, Igor B. Rogozin

Proceedings of the Proceedings 15th International Conference on Intelligent Systems for Molecular Biology (ISMB) & 6th European Conference on Computational Biology (ECCB), 2007

2006

On the Estimation of Intron Evolution.

Miklós Csürös

PLoS Comput. Biol., 2006

Segmentation with an Isochore Distribution.

Miklós Csürös, Ming-Te Cheng, Andreas Grimm, Amine Halawani, Perrine Landreau

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer.

Miklós Csürös, István Miklós

Proceedings of the Research in Computational Molecular Biology, 2006

2005

Single-user tracing and disjointly superimposed codes.

Miklós Csürös, Miklós Ruszinkó

IEEE Trans. Inf. Theory, 2005

A linear-time algorithm for finding the longest segment which scores above a given threshold

Miklós Csürös

CoRR, 2005

Likely Scenarios of Intron Evolution.

Miklós Csürös

Proceedings of the Comparative Genomics, 2005

Rapid Homology Search with Two-Stage Extension and Daughter Seeds.

Miklós Csürös, Bin Ma

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Maximum-Scoring Segment Sets.

Miklós Csürös

IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Pooled Genomic Indexing (PGI): Analysis and Design of Experiments.

Miklós Csürös, Aleksandar Milosavljevic

J. Comput. Biol., 2004

Algorithms for Finding Maximal-Scoring Segment Sets (Extended Abstract).

Miklós Csürös

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Single user tracing superimposed codes.

Miklós Csürös, Miklós Ruszinkó

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Performing Local Similarity Searches with Variable Length Seeds.

Miklós Csürös

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2002

Fast Recovery of Evolutionary Trees with Thousands of Nodes.

Miklós Csürös

J. Comput. Biol., 2002

Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design.

Miklós Csürös, Aleksandar Milosavljevic

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

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

1999

Recovering Evolutionary Trees Through Harmonic Greedy Triplets.

Miklós Csürös, Ming-Yang Kao

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997

Learning Markov Chains with Variable Memory Length from Noisy Output.

Dana Angluin, Miklós Csürös

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997