Search the dblp DataBase

Publications of Author

1. Miklós Csürös, Bin Ma
   Rapid Homology Search with Two-Stage Extension and Daughter Seeds. [Citation Graph (0, 0)][DBLP]
   COCOON, 2005, pp:104-114 [Conf]
   
2. Dana Angluin, Miklós Csürös
   Learning Markov Chains with Variable Memory Length from Noisy Output. [Citation Graph (0, 0)][DBLP]
   COLT, 1997, pp:298-308 [Conf]
   
3. Miklós Csürös
   Performing Local Similarity Searches with Variable Length Seeds. [Citation Graph (0, 0)][DBLP]
   CPM, 2004, pp:373-387 [Conf]
   
4. Miklós Csürös
   Fast recovery of evolutionary trees with thousands of nodes. [Citation Graph (0, 0)][DBLP]
   RECOMB, 2001, pp:104-113 [Conf]
   
5. Miklós Csürös
   Likely Scenarios of Intron Evolution. [Citation Graph (0, 0)][DBLP]
   Comparative Genomics, 2005, pp:47-60 [Conf]
   
6. Miklós Csürös, István Miklós
   A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer. [Citation Graph (0, 0)][DBLP]
   RECOMB, 2006, pp:206-220 [Conf]
   
7. Miklós Csürös, Ming-Yang Kao
   Recovering Evolutionary Trees Through Harmonic Greedy Triplets. [Citation Graph (0, 0)][DBLP]
   SODA, 1999, pp:261-270 [Conf]
   
8. Miklós Csürös
   Algorithms for Finding Maximal-Scoring Segment Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   WABI, 2004, pp:62-73 [Conf]
   
9. Miklós Csurös, Ming-Te Cheng, Andreas Grimm, Amine Halawani, Perrine Landreau
   Segmentation with an Isochore Distribution. [Citation Graph (0, 0)][DBLP]
   WABI, 2006, pp:388-399 [Conf]
   
10. Miklós Csürös, Aleksandar Milosavljevic
    Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:10-28 [Conf]
    
11. Miklós Csürös, Ming-Yang Kao
    Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
    
12. Miklós Csürös
    Fast Recovery of Evolutionary Trees with Thousands of Nodes. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:2, pp:277-297 [Journal]
    
13. Miklós Csürös, Aleksandar Milosavljevic
    Pooled Genomic Indexing (PGI): Analysis and Design of Experiments. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:5, pp:1001-1021 [Journal]
    
14. Miklós Csürös, Ming-Yang Kao
    Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:306-322 [Journal]
    
15. Miklós Csürös
    Maximum-Scoring Segment Sets. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:4, pp:139-150 [Journal]
    
16. Miklós Csürös, Bin Ma
    Rapid Homology Search with Neighbor Seeds. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:2, pp:187-202 [Journal]
    
17. 
    Approximate Counting with a Floating-Point Counter. [Citation Graph (, )][DBLP]
    
    
18. 
    In search of lost introns. [Citation Graph (, )][DBLP]
    
    
19. 
    Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions. [Citation Graph (, )][DBLP]
    
    
20. 
    Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA. [Citation Graph (, )][DBLP]
    
    
21. 
    Malin: maximum likelihood analysis of intron evolution in eukaryotes. [Citation Graph (, )][DBLP]
    
    
22. 
    A linear-time algorithm for finding the longest segment which scores above a given threshold [Citation Graph (, )][DBLP]
    
    
23. 
    Approximate counting with a floating-point counter [Citation Graph (, )][DBLP]