Crochemore's partitioning on weighted strings and applications

DOI10.1007/s00453-016-0266-0zbMath1391.68128OpenAlexW2582169998MaRDI QIDQ1709578

Solon P. Pissis, Carl Barton

Publication date: 6 April 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://kclpure.kcl.ac.uk/portal/en/publications/crochemores-partitioning-on-weighted-strings-and-applications(8e6b6320-34a2-479b-952b-e0a10af5b543).html

zbMATH Keywords

seedscoversrepetitionsuncertain sequencesweighted stringsCrochemore partitioningposition-weight matrix

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

Fast Average-Case Pattern Matching on Weighted Sequences ⋮ On-line weighted pattern matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time approximation algorithms for weighted LCS problem
• Computing covers using prefix tables
• Enhanced string covering
• Linear-time version of Holub's algorithm for morphic imprimitivity testing
• Linear-time computation of prefix table for weighted strings {\&} applications
• Optimal superprimitivity testing for strings
• Property matching and weighted matching
• Optimality of some algorithms to detect quasiperiodicities
• An optimal algorithm for computing the repetitions in a word
• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• Covering problems for partial words and for indeterminate strings
• The number of runs in a string
• On-Line Pattern Matching on Uncertain Sequences and Applications
• An O(n log n) algorithm for finding all repetitions in a string
• Varieties of Regularities in Weighted Sequences
• Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
• The “Runs” Theorem
• Computing the cover array in linear time

This page was built for publication: Crochemore's partitioning on weighted strings and applications