Showing results 11 to 23 of 23
< previous
| Title | Author(s) | Issue Date | |
|---|---|---|---|
A Faster and Unifying algorithm for Comparing Trees Proceeding/Conference:Proceedings of the 11th Annual Symposium on Combinatiorial Pattern Matching | 2000 | ||
Improved approximate string matching using compressed suffix data structures Proceeding/Conference:Algorithmica (New York) | 2008 | ||
Indexing similar DNA sequences Proceeding/Conference:Lecture Notes in Computer Science | 2010 | ||
A linear size index for approximate pattern matching Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2006 | ||
A linear size index for approximate pattern matching Proceeding/Conference:Journal of Discrete Algorithms | 2011 | ||
A mutation-sensitive approach for locating conserved gene pairs between related species Proceeding/Conference:Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004 | 2004 | ||
Pervasive Multimedia Markup Language (PMML): an XML-based Multimedia Content Specification for Pervasive Access Proceeding/Conference:International Conference on World Wide Web, WWW'01 | 2001 | ||
The point placement problem on a line improved bounds for pairwise distance queries Proceeding/Conference:Lecture Notes in Computer Science | 2007 | ||
Practical aspects of compressed suffix arrays and FM-index in searching DNA sequences Proceeding/Conference:Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics | 2004 | ||
Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees Proceeding/Conference:Lecture Notes in Computer Science | 2013 | ||
A space adn time efficient algorithm for constructing compressed suffix arragys Proceeding/Conference:Proceedings of the 8th Annual International Computing and Combinatorics Conference | 2002 | ||
Space efficient indexes for string matching with don't cares Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison Proceeding/Conference:Proceedings of the 11th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science | 2000 |