Miklós Csürös

According to our database1, Miklós Csürös authored at least 29 papers between 1997 and 2016.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Distance-Based Phylogeny Reconstruction (Fast-Converging).
Encyclopedia of Algorithms, 2016

Joint genotype inference with germline and somatic mutations.
BMC Bioinformatics, 2013

How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

A novel mathematical basis for predicting somatic single nucleotide variants from next-generation sequencing.
Proceedings of the ACM International Conference on Bioinformatics, 2012

A Detailed History of Intron-rich Eukaryotic Ancestors Inferred from a Global Survey of 100 Complete Genomes.
PLoS Computational Biology, 2011

Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Approximate Counting with a Floating-Point Counter.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Distance-Based Phylogeny Reconstruction (Fast-Converging).
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Malin: maximum likelihood analysis of intron evolution in eukaryotes.
Bioinformatics, 2008

Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions.
Proceedings of the Comparative Genomics, International Workshop, 2008

Rapid Homology Search with Neighbor Seeds.
Algorithmica, 2007

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

On the Estimation of Intron Evolution.
PLoS Computational Biology, 2006

Segmentation with an Isochore Distribution.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer.
Proceedings of the Research in Computational Molecular Biology, 2006

Single-user tracing and disjointly superimposed codes.
IEEE Trans. Information Theory, 2005

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

Likely Scenarios of Intron Evolution.
Proceedings of the Comparative Genomics, 2005

Rapid Homology Search with Two-Stage Extension and Daughter Seeds.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Maximum-Scoring Segment Sets.
IEEE/ACM Trans. Comput. Biology Bioinform., 2004

Pooled Genomic Indexing (PGI): Analysis and Design of Experiments.
Journal of Computational Biology, 2004

Algorithms for Finding Maximal-Scoring Segment Sets (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Single user tracing superimposed codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Performing Local Similarity Searches with Variable Length Seeds.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Fast Recovery of Evolutionary Trees with Thousands of Nodes.
Journal of Computational Biology, 2002

Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets.
SIAM J. Comput., 2001

Recovering Evolutionary Trees Through Harmonic Greedy Triplets.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Learning Markov Chains with Variable Memory Length from Noisy Output.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997