On the inadequacy of tournament algorithms for the \(N\)-SCS problem

DOI10.1016/0020-0190(91)90094-XzbMath0736.68029OpenAlexW2022467404MaRDI QIDQ1178218

James H. Bradford, T. A. Jenkyns

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90094-x

zbMATH Keywords

sequence comparisonshortest common supersequencetournament algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Related Items (1)

Sequence matching with binary codes

Cites Work

• A common basis for similarity measures involving two strings†
• A linear space algorithm for computing maximal common subsequences
• Bounds for the String Editing Problem
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms for the Longest Common Subsequence Problem

This page was built for publication: On the inadequacy of tournament algorithms for the \(N\)-SCS problem