Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
- 27 November 2014
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 73 (3) , 571-588
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Sub-quadratic time and linear space data structures for permutation matching in binary stringsJournal of Discrete Algorithms, 2012
- Upper and lower bounds for finding connected motifs in vertex-colored graphsJournal of Computer and System Sciences, 2011
- Complexity issues in vertex-colored graph pattern matchingJournal of Discrete Algorithms, 2011
- Indexing permutations for binary stringsInformation Processing Letters, 2010
- Simulating multiplexed SNP discovery rates using base-specific cleavage and mass spectrometryBioinformatics, 2007
- The Smallest Grammar ProblemIEEE Transactions on Information Theory, 2005
- Application of Lempel–Ziv factorization to the approximation of grammar-based compressionTheoretical Computer Science, 2003
- Optimal on-line decremental connectivity in treesInformation Processing Letters, 1997
- Treewidth: Algorithmic techniques and results1997
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980