Showing results 1 to 20 of 23
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
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 | 95 | ||
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 | 110 | ||
A space adn time efficient algorithm for constructing compressed suffix arragys Proceeding/Conference:Proceedings of the 8th Annual International Computing and Combinatorics Conference | 2002 | 91 | ||
Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees Proceeding/Conference:Lecture Notes in Computer Science | 2013 | 51 | ||
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 | 92 | ||
The point placement problem on a line improved bounds for pairwise distance queries Proceeding/Conference:Lecture Notes in Computer Science | 2007 | 95 | ||
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 | 80 | ||
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 | 109 | ||
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 | 98 | ||
A linear size index for approximate pattern matching Proceeding/Conference:Journal of Discrete Algorithms | 2011 | 106 | ||
Indexing similar DNA sequences Proceeding/Conference:Lecture Notes in Computer Science | 2010 | 114 | ||
Improved approximate string matching using compressed suffix data structures Proceeding/Conference:Algorithmica (New York) | 2008 | 100 | ||
A Faster and Unifying algorithm for Comparing Trees Proceeding/Conference:Proceedings of the 11th Annual Symposium on Combinatiorial Pattern Matching | 2000 | 96 | ||
An experimental study of compressed indexing and local alignments of DNA Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | 97 | ||
Default-sensitive preprocessings for finding maxima Proceeding/Conference:Computing Theory '98: Proceedings of the 4th Australasian Theory Symposium - CATS'98 Perth, 2-3 February 1998 | 1999 | 84 | ||
A Decomposition Theorem For Maximum Weight Bipartite Matchings with Applications To Evolutionary Trees Proceeding/Conference:Proceedings of the European Symposium on Algorithms | 1999 | 111 | ||
Construction of online catalog topologies using decision trees Proceeding/Conference:International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems Proceedings | 2000 | 144 | ||
Computing the unrooted maximum agreement subtree in sub-quadratic time Proceeding/Conference:Proceedings of the 5th Scandinavian Workshop on Algorithm and Theory, Singapore | 1996 | 100 | ||
Compressed indexes for approximate string matching Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2006 | 191 | ||
Compressed index for dynamic text Proceeding/Conference:Data Compression Conference Proceedings | 2004 | 79 |