default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiklós Csürös
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i4]Miklós Csürös:
Gain-loss-duplication models on a phylogeny: exact algorithms for computing the likelihood and its gradient. CoRR abs/2107.11440 (2021)
2010 – 2019
- 2016
- [r2]Miklós Csürös:
Distance-Based Phylogeny Reconstruction (Fast-Converging). Encyclopedia of Algorithms 2016: 564-567 - 2013
- [j10]Eric Bareke
, Virginie Saillour, Jean-François Spinella, Ramon Vidal, Jasmine Healy, Daniel Sinnett, Miklós Csürös:
Joint genotype inference with germline and somatic mutations. BMC Bioinform. 14(S-5): S3 (2013) - [p1]Miklós Csürös:
How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree. Models and Algorithms for Genome Evolution 2013: 29-45 - 2012
- [c16]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
- [j9]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 Comput. Biol. 7(9) (2011) - 2010
- [c15]Miklós Csürös:
Approximate Counting with a Floating-Point Counter. COCOON 2010: 358-367 - [c14]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
2000 – 2009
- 2009
- [i3]Miklós Csürös:
Approximate counting with a floating-point counter. CoRR abs/0904.3062 (2009) - 2008
- [j8]Miklós Csürös:
Malin: maximum likelihood analysis of intron evolution in eukaryotes. Bioinform. 24(13): 1538-1539 (2008) - [c13]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
- [j7]Miklós Csürös, Bin Ma:
Rapid Homology Search with Neighbor Seeds. Algorithmica 48(2): 187-202 (2007) - [c12]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
- [j6]Miklós Csürös:
On the Estimation of Intron Evolution. PLoS Comput. Biol. 2(7) (2006) - [c11]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 - [c10]Miklós Csürös, Ming-Te Cheng, Andreas Grimm, Amine Halawani, Perrine Landreau:
Segmentation with an Isochore Distribution. WABI 2006: 388-399 - 2005
- [j5]Miklós Csürös, Miklós Ruszinkó:
Single-user tracing and disjointly superimposed codes. IEEE Trans. Inf. Theory 51(4): 1606-1611 (2005) - [c9]Miklós Csürös, Bin Ma:
Rapid Homology Search with Two-Stage Extension and Daughter Seeds. COCOON 2005: 104-114 - [c8]Miklós Csürös:
Likely Scenarios of Intron Evolution. Comparative Genomics 2005: 47-60 - [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. J. Comput. Biol. 11(5): 1001-1021 (2004) - [j3]Miklós Csürös:
Maximum-Scoring Segment Sets. IEEE ACM Trans. Comput. Biol. Bioinform. 1(4): 139-150 (2004) - [c7]Miklós Csürös:
Performing Local Similarity Searches with Variable Length Seeds. CPM 2004: 373-387 - [c6]Miklós Csürös, Miklós Ruszinkó:
Single user tracing superimposed codes. ISIT 2004: 255 - [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. J. Comput. Biol. 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]Miklós Csürös:
Fast recovery of evolutionary trees with thousands of nodes. RECOMB 2001: 104-113 - 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)
1990 – 1999
- 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
