Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance

DOI10.1137/S0097539793246707MaRDI QIDQ4376175zbMATH OpenOpenAlexFDO

Authors Brenda S. Baker

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

zbMATH Keywords

duplicationpattern matchingsoftware maintenancestring matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Parallel algorithms in computer science (68W10)

Recommendations

• Parameterized pattern matching: Algorithms and applications
• Parameterized matching on non-linear structures
• Towards a real time algorithm for parameterized longest common prefix computation
• Alphabet dependence in parameterized matching
• Sublinear Algorithms for Parameterized Matching

Cited in

(33)

• On the longest common parameterized subsequence
• Parameterized pattern matching: Algorithms and applications
• On-line construction of parameterized suffix trees for large alphabets
• A comparative study of dictionary matching with gaps: limitations, techniques and challenges
• Finding patterns and periods in Cartesian tree matching
• Online parameterized dictionary matching with one gap
• Towards a real time algorithm for parameterized longest common prefix computation
• Parameterized dictionary matching and recognition with one gap
• A brief history of parameterized matching problems
• Weighted approximate parameterized string matching
• Secure parameterized pattern matching
• scientific article; zbMATH DE number 1692952 (Why is no real title available?)
• The finite automata approaches in stringology
• Periodicity and Repetitions in Parameterized Strings
• On the Longest Common Parameterized Subsequence
• Forty Years of Text Indexing
• Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
• Sufficient conditions for efficient indexing under different matchings
• Cartesian Tree Matching and Indexing
• A filtering technique for all pairs approximate parameterized string matching
• scientific article; zbMATH DE number 7765421 (Why is no real title available?)
• Reconstructing parameterized strings from parameterized suffix and LCP arrays
• Reconstructing parameterized strings from parameterized suffix and LCP arrays
• Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
• Breaking a barrier in constructing compact indexes for parameterized pattern matching
• Inverting parameterized Burrows-Wheeler transform
• Reconstructing general matching graphs
• Parameterized searching with mismatches for run-length encoded strings
• Efficient parameterized string matching
• Parameterized matching with mismatches
• Periodicity and repetitions in parameterized strings
• Pattern matching with pair correlation distance
• Parameterized matching on non-linear structures

This page was built for publication: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376175)