Maximal common subsequence algorithms

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
編集者Binhai Zhu, Gonzalo Navarro, David Sankoff
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ページ11-110
ページ数100
ISBN(電子版)9783959770743
DOI
出版ステータスPublished - 2018 5 1
イベント29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 - Qingdao, China
継続期間: 2018 7 22018 7 4

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
105
ISSN(印刷版)1868-8969

Other

Other29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
国/地域China
CityQingdao
Period18/7/218/7/4

ASJC Scopus subject areas

  • ソフトウェア

引用スタイル