Showing results 17 to 28 of 28
< previous
| Title | Author(s) | Issue Date | |
|---|---|---|---|
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 | ||
Compressing Dictionary Matching Index via Sparsification Technique Journal:Algorithmica | 2015 | ||
Compressed indexes for dynamic text collections Journal:ACM Transactions on Algorithms | 2007 | ||
Compressed index for dynamic text Proceeding/Conference:Data Compression Conference Proceedings | 2004 | ||
Compressed index for dictionary matching Proceeding/Conference:Data Compression Conference Proceedings | 2008 | ||
Compressed index for a dynamic collection of texts Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004 | ||
Cache-oblivious index for approximate string matching Journal:Theoretical Computer Science | 2011 | ||
Cache-oblivious index for approximate string matching Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
Approximating the Nearest Neighbor Interchange Distance for Non-Uniform-Degree Evolutionary Trees Journal:International Journal of Foundations of Computer Science | 2001 | ||
Approximating the nearest neighbor interchange distance for evolutionary trees with non-uniform degrees Proceeding/Conference:Proceedings of the Fifth Annual International Computing and Combinatorics Conference (COCOON'99) | 1999 | ||
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 | ||
Approximate string matching using compressed suffix arrays Journal:Theoretical Computer Science | 2006 |