Showing results 1 to 20 of 28
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Succinct index for dynamic dictionary matching Proceeding/Conference:Lecture Notes in Computer Science | 2009 | ||
Subtree Transfer Distance for Degree-d Phylogenies Journal:International Journal of Foundations of Computer Science | 2004 | ||
A space and time efficient algorithm for constructing compressed suffix arrays Journal:Algorithmica (New York) | 2007 | ||
RNASAlign: RNA structural alignment system Journal:Bioinformatics | 2011 | ||
Reconstructing One-Articulated Networks with Distance Matrices Proceeding/Conference:Bioinformatics Research and Applications | 2017 | ||
Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees Proceeding/Conference:Lecture Notes in Computer Science | 2013 | ||
Predicting RNA secondary structures: one-grammar-fits-all solution Proceeding/Conference:Lecture Notes in Computer Science | 2015 | ||
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 | ||
Non-shared edges and nearest neighbor interchanges revisited Journal:Information Processing Letters | 2004 | ||
A Local Structural Prediction Algorithm for RNA Triple Helix Structure Proceeding/Conference:International Conference on Pattern Recognition in Bioinformatics | 2013 | ||
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 | ||
Identifying volatile data from multiple memory dumps in live forensics Proceeding/Conference:IFIP Advances in Information and Communication Technology | 2010 | ||
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 | ||
Dynamic dictionary matching and compressed suffix trees Proceeding/Conference:Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2005 | ||
Dictionary matching with uneven gaps Proceeding/Conference:Lecture Notes in Computer Science | 2015 | ||
Dictionary Matching with a Bounded Gap in Pattern or in Text Journal:Algorithmica | 2018 | ||
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 |