Algorithms For Computing Approximate Repetitions In Musical Sequences

DOI10.1080/00207160213939zbMath1008.68043OpenAlexW2125573542MaRDI QIDQ4780537

Yoan J. Pinzon, Emilios Cambouropoulos, Maxime Crochemore, Laurent Mouchard, Costas S. Iliopoulos

Publication date: 6 February 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160213939

zbMATH Keywords

approximate matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (12)

On building minimal automaton for subset matching queries ⋮ A Filtering Technique for All Pairs Approximate Parameterized String Matching ⋮ Order-preserving matching ⋮ Extending alignments with \(k\)-mismatches and \(\ell\)-gaps ⋮ Approximate pattern matching with \(k\)-mismatches in packed text ⋮ AVOIDING APPROXIMATE SQUARES ⋮ NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES ⋮ Unnamed Item ⋮ A brief history of parameterized matching problems ⋮ Unnamed Item ⋮ Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata ⋮ Order-preserving pattern matching indeterminate strings

Cites Work

• Unnamed Item
• Unnamed Item
• Fast string matching with k differences
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• Covering a string
• The subtree max gap problem with application to parallel string covering
• An O(n log n) algorithm for finding all repetitions in a string
• An Improved Algorithm For Approximate String Matching
• Efficient algorithms for molecular sequence analysis.
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

This page was built for publication: Algorithms For Computing Approximate Repetitions In Musical Sequences