scientific article; zbMATH DE number 1445383
From MaRDI portal
Publication:4952706
Recommendations
- Dynamic text and static pattern matching
- Dynamic text and static pattern matching.
- scientific article; zbMATH DE number 1497852
- Contextual Pattern Matching
- Pattern Matching in Hypertext
- Pattern matching in hypertext
- Internal pattern matching queries in a text and applications
- Pattern Matching
- Fast pattern matching in indexed texts
- Searching for a modified pattern in a changing text
Cited in
(31)- Text sparsification via local maxima.
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Dynamic and internal longest common substring
- The complexity of compressed membership problems for finite automata
- Dynamic index and LZ factorization in compressed space
- scientific article; zbMATH DE number 1696736 (Why is no real title available?)
- Dynamic string searching
- Dynamic text and static pattern matching
- scientific article; zbMATH DE number 437564 (Why is no real title available?)
- scientific article; zbMATH DE number 2128983 (Why is no real title available?)
- Upper and lower bounds for dynamic data structures on strings
- Equality Testing of Compressed Strings
- Optimal On-Line Search and Sublinear Time Update in String Matching
- On the parallel dynamic dictionary matching problem: new results with applications
- Edit distance with block operations
- Longest common substring made fully dynamic
- Internal pattern matching queries in a text and applications
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Dynamic text and static pattern matching.
- scientific article; zbMATH DE number 7765421 (Why is no real title available?)
- Two-dimensional pattern matching on a dynamic library of texts
- Searching for a modified pattern in a changing text
- Space-efficient conversions from SLPs
- Dynamic longest common substring in polylogarithmic time
- A textbook solution for dynamic strings
- Minimizing tardy processing time on a single machine in near-linear time
- Construction of sparse suffix trees and LCE indexes in optimal time and space
- Minimizing tardy processing time on a single machine in near-linear time
- Locally consistent parsing for text indexing in small space
- Logarithmic-time internal pattern matching queries in compressed and dynamic texts
- A textbook solution for dynamic strings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952706)
