Window-accumulated subsequence matching problem is linear
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 327-336
- https://doi.org/10.1145/303976.304008
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Matching a set of strings with variable length don't caresTheoretical Computer Science, 1997
- On-line construction of suffix treesAlgorithmica, 1995
- On the Power of the Shift InstructionInformation and Computation, 1995
- Fast text searchingCommunications of the ACM, 1992
- A new approach to text searchingCommunications of the ACM, 1992
- Multiplication, division, and shift instructions in parallel random access machinesTheoretical Computer Science, 1992
- An algorithm for string matching with a sequence of don't caresInformation Processing Letters, 1991
- String Matching in Real TimeJournal of the ACM, 1981
- A characterization of the power of vector machinesPublished by Association for Computing Machinery (ACM) ,1974