Algorithms for Computing the Longest Parameterized Common Subsequence

DOI10.1007/978-3-540-73437-6_27zbMath1138.68660OpenAlexW2170721049MaRDI QIDQ3506928

Costas S. Iliopoulos, M. Sohel Rahman, Tomasz Walen, Marcin Kubica

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Data structures (68P05)

Related Items (7)

Computing the longest common almost-increasing subsequence ⋮ Weighted approximate parameterized string matching ⋮ Hardness and approximation of multiple sequence alignment with column score ⋮ Longest Common Subsequence with Gap Constraints ⋮ Finding the gapped longest common subsequence by incremental suffix maximum queries ⋮ Unnamed Item ⋮ A brief history of parameterized matching problems

This page was built for publication: Algorithms for Computing the Longest Parameterized Common Subsequence