Maximal common subsequence algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A common subsequence of two strings is maximal, if inserting any character into the subsequence can no longer yield a common subsequence of the two strings. The present article proposes a (sub)linearithmic-time, linear-space algorithm for finding a maximal common subsequence of two strings and also proposes a linear-time algorithm for determining if a common subsequence of two strings is maximal.

Original languageEnglish
Title of host publication29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
EditorsBinhai Zhu, Gonzalo Navarro, David Sankoff
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages11-110
Number of pages100
ISBN (Electronic)9783959770743
DOIs
Publication statusPublished - 2018 May 1
Event29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 - Qingdao, China
Duration: 2018 Jul 22018 Jul 4

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume105
ISSN (Print)1868-8969

Other

Other29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
CountryChina
CityQingdao
Period18/7/218/7/4

Keywords

  • Algorithms
  • Constrained longest common subsequence
  • Longest common subsequence
  • String comparison

ASJC Scopus subject areas

  • Software

Cite this

Sakai, Y. (2018). Maximal common subsequence algorithms. In B. Zhu, G. Navarro, & D. Sankoff (Eds.), 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 (pp. 11-110). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 105). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2018.1