Showing results 1 to 20 of 23
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
All-cavity maximum Matchings Proceeding/Conference:International Symposium on Algorithms And Computation | 1997 | 160 | ||
Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness Proceeding/Conference:Series on Advances In Bioinformatics and Computational Biology | 2005 | |||
Automatic Construction of Online Catalog Topologies Using Decision Trees Proceeding/Conference:2nd International Conference on Electronic Commerce and Web Technologies (EC-Web 2001) | 2001 | 94 | ||
Compressed index for dynamic text Proceeding/Conference:Data Compression Conference Proceedings | 2004 | 84 | ||
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 | 199 | ||
Computing the unrooted maximum agreement subtree in sub-quadratic time Proceeding/Conference:Proceedings of the 5th Scandinavian Workshop on Algorithm and Theory, Singapore | 1996 | 105 | ||
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 | 155 | ||
A Decomposition Theorem For Maximum Weight Bipartite Matchings with Applications To Evolutionary Trees Proceeding/Conference:Proceedings of the European Symposium on Algorithms | 1999 | 126 | ||
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 | 91 | ||
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 | 103 | ||
A Faster and Unifying algorithm for Comparing Trees Proceeding/Conference:Proceedings of the 11th Annual Symposium on Combinatiorial Pattern Matching | 2000 | 103 | ||
Improved approximate string matching using compressed suffix data structures Proceeding/Conference:Algorithmica (New York) | 2008 | 107 | ||
Indexing similar DNA sequences Proceeding/Conference:Lecture Notes in Computer Science | 2010 | 130 | ||
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 | 120 | ||
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 | 90 | ||
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 | 100 | ||
Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees Proceeding/Conference:Lecture Notes in Computer Science | 2013 | 51 |