Showing results 1 to 20 of 59
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
| 2010 | |||
All-cavity maximum Matchings Proceeding/Conference:International Symposium on Algorithms And Computation | 1997 | ||
Allowing Mismatches In Anchors For Whole Genome Alignment Journal:W S E A S Transactions on Biology and Biomedicine | 2007 | ||
Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness Proceeding/Conference:Series on Advances In Bioinformatics and Computational Biology | 2005 | ||
Approximate string matching using compressed suffix arrays Journal:Theoretical Computer Science | 2006 | ||
Approximate string matching using compressed suffix arrays Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004 | ||
Automatic construction of online catalog topologies Journal:IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews | 2002 | ||
Automatic Construction of Online Catalog Topologies Using Decision Trees Proceeding/Conference:2nd International Conference on Electronic Commerce and Web Technologies (EC-Web 2001) | 2001 | ||
Cavity matchings, label compressions, and unrooted evolutionary trees Journal:SIAM Journal on Computing | 2000 | ||
Comparison of two approaches to building a vertical search tool: A case study in the nanotechnology domain Proceeding/Conference:Proceedings of the ACM International Conference on Digital Libraries | 2002 | ||
Compressed index for dynamic text Proceeding/Conference:Data Compression Conference Proceedings | 2004 | ||
Compressed indexes for approximate string matching Journal:Algorithmica (New York) | 2010 | ||
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 | ||
Compressed indexing and local alignment of DNA Journal:Bioinformatics | 2008 | ||
Computing the unrooted maximum agreement subtree in sub-quadratic time Proceeding/Conference:Proceedings of the 5th Scandinavian Workshop on Algorithm and Theory, Singapore | 1996 | ||
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time Journal:Nordic Journal of Computing | 1996 | ||
Constructing compressed suffix arrays with large alphabets Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2003 | ||
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 | ||
| 2014 | |||
A decomposition theorem for maximum weight bipartite matchings Journal:SIAM Journal on Computing | 2001 |