Reconstructing parameterized strings from parameterized suffix and LCP arrays
From MaRDI portal
Publication:6199197
DOI10.1016/j.tcs.2023.114230MaRDI QIDQ6199197
Dina Sokol, Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus
Publication date: 23 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Parameterized matching with mismatches
- Alphabet dependence in parameterized matching
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Parameterized pattern matching: Algorithms and applications
- String inference from longest-common-prefix array
- Inferring strings from Lyndon factorization
- Fast Algorithms for Finding Nearest Common Ancestors
- RECONSTRUCTING A SUFFIX ARRAY
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Words over an ordered alphabet and suffix permutations
This page was built for publication: Reconstructing parameterized strings from parameterized suffix and LCP arrays
