Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
From MaRDI portal
Publication:4376175
DOI10.1137/S0097539793246707zbMath0885.68085OpenAlexW2066688923MaRDI QIDQ4376175
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793246707
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Parallel algorithms in computer science (68W10)
Related Items (27)
Efficient parameterized string matching ⋮ Secure parameterized pattern matching ⋮ Weighted approximate parameterized string matching ⋮ On the Longest Common Parameterized Subsequence ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ On-line construction of parameterized suffix trees for large alphabets ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ A Filtering Technique for All Pairs Approximate Parameterized String Matching ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Online parameterized dictionary matching with one gap ⋮ Unnamed Item ⋮ Parameterized matching with mismatches ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ Parameterized dictionary matching and recognition with one gap ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Periodicity and repetitions in parameterized strings ⋮ Pattern matching with pair correlation distance ⋮ Forty Years of Text Indexing ⋮ Parameterized searching with mismatches for run-length encoded strings ⋮ Unnamed Item ⋮ Parameterized matching on non-linear structures ⋮ Unnamed Item ⋮ A brief history of parameterized matching problems ⋮ Cartesian Tree Matching and Indexing ⋮ On the longest common parameterized subsequence ⋮ Periodicity and Repetitions in Parameterized Strings ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges
This page was built for publication: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
