Miklós Csürös

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

Coauthor Index

1	Dana Angluin	[1]
2	Attila Bérces	[24]
3	Ming-Te Cheng	[16]
4	Andreas Grimm	[16]
5	Amine Halawani	[16]
6	J. Andrew Holey	[19]
7	Szilveszter Juhos	[24]
8	Ming-Yang Kao	[2] [3] [4]
9	Eugene V. Koonin	[26]
10	Perrine Landreau	[16]
11	Bin Ma	[14] [18]
12	István Miklós	[17]
13	Aleksandar Milosavljevic	[7] [8]
14	Igor B. Rogozin	[19] [26]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page