Showing results 1 to 20 of 28
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Approximate string matching using compressed suffix arrays Journal:Theoretical Computer Science | 2006 | 98 | ||
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 | 94 | ||
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 | 97 | ||
Approximating the Nearest Neighbor Interchange Distance for Non-Uniform-Degree Evolutionary Trees Journal:International Journal of Foundations of Computer Science | 2001 | 101 | ||
Cache-oblivious index for approximate string matching Journal:Theoretical Computer Science | 2011 | 118 | ||
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 | 110 | ||
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 | 93 | ||
Compressed index for dictionary matching Proceeding/Conference:Data Compression Conference Proceedings | 2008 | 125 | ||
Compressed index for dynamic text Proceeding/Conference:Data Compression Conference Proceedings | 2004 | 79 | ||
Compressed indexes for dynamic text collections Journal:ACM Transactions on Algorithms | 2007 | 120 | ||
Compressing Dictionary Matching Index via Sparsification Technique Journal:Algorithmica | 2015 | 42 | ||
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 | ||
Dictionary Matching with a Bounded Gap in Pattern or in Text Journal:Algorithmica | 2018 | 63 | ||
Dictionary matching with uneven gaps Proceeding/Conference:Lecture Notes in Computer Science | 2015 | 68 | ||
Dynamic dictionary matching and compressed suffix trees Proceeding/Conference:Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2005 | 101 | ||
Identifying static and dynamic volatile memory data from multiple dumps for live forensics Proceeding/Conference:6th IFIP WG 11.9 International Conference on Digital Forensics | 2010 | 162 | ||
Identifying volatile data from multiple memory dumps in live forensics Proceeding/Conference:IFIP Advances in Information and Communication Technology | 2010 | 131 | ||
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers Proceeding/Conference:Proceedings of the 11th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science | 2000 | 92 | ||
A Local Structural Prediction Algorithm for RNA Triple Helix Structure Proceeding/Conference:International Conference on Pattern Recognition in Bioinformatics | 2013 | 38 | ||
Non-shared edges and nearest neighbor interchanges revisited Journal:Information Processing Letters | 2004 | 176 |