Showing results 9 to 28 of 59
< previous
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Cavity matchings, label compressions, and unrooted evolutionary trees Journal:SIAM Journal on Computing | 2000 | 193 | ||
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 | 35 | ||
Compressed index for dynamic text Proceeding/Conference:Data Compression Conference Proceedings | 2004 | 79 | ||
Compressed indexes for approximate string matching Journal:Algorithmica (New York) | 2010 | 101 | ||
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 indexing and local alignment of DNA Journal:Bioinformatics | 2008 | 184 | ||
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time Journal:Nordic Journal of Computing | 1996 | 90 | ||
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 | ||
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 | 112 | ||
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 | ||
| 2014 | 54 | |||
A decomposition theorem for maximum weight bipartite matchings Journal:SIAM Journal on Computing | 2001 | 209 | ||
A Decomposition Theorem For Maximum Weight Bipartite Matchings with Applications To Evolutionary Trees Proceeding/Conference:Proceedings of the European Symposium on Algorithms | 1999 | 111 | ||
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 | ||
Design and evaluation of a Facebook game for self-directed e-learning Journal:Knowledge Management & E-Learning: An International Journal | 2016 | 71 | ||
Detection of generic spaced motifs using submotif pattern mining Journal:Bioinformatics | 2007 | 152 | ||
Evaluating Students' Perception of a Three-Dimensional Virtual World Learning Environment Journal:Knowledge Management & E-Learning: An International Journal | 2013 | 63 | ||
An even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings Journal:Journal of Algorithms | 2001 | 174 | ||
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 | ||
A Faster and Unifying algorithm for Comparing Trees Proceeding/Conference:Proceedings of the 11th Annual Symposium on Combinatiorial Pattern Matching | 2000 | 96 |