Fully incremental LCS computation

Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Sequence comparison is & fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A, B and characters a, b, compute LCS(aA, B), LCS(A, bB), LCS(Aa, B), and LCS(A, Bb), provided that L = LCS(A, B) is already computed. We present an efficient algorithm that computes the four LCS values above, in O(L) or O(n) time depending on where a new character is added, where n is the length of A. Our algorithm is superior in both time and space complexities to the previous known methods.

Original languageEnglish
Pages (from-to)563-574
Number of pages12
JournalLecture Notes in Computer Science
Volume3623
Publication statusPublished - 2005

Fingerprint

Longest Common Subsequence
Pattern matching
Information retrieval
Sequence Comparison
Space Complexity
Pattern Matching
Information Retrieval
Time Complexity
Efficient Algorithms
Strings
Metric
Computing

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Fully incremental LCS computation. / Ishida, Yusuke; Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki.

In: Lecture Notes in Computer Science, Vol. 3623, 2005, p. 563-574.

Research output: Contribution to journalArticle

Ishida, Yusuke ; Inenaga, Shunsuke ; Shinohara, Ayumi ; Takeda, Masayuki. / Fully incremental LCS computation. In: Lecture Notes in Computer Science. 2005 ; Vol. 3623. pp. 563-574.
@article{5d21b112356b4796b499cd565aa82d8d,
title = "Fully incremental LCS computation",
abstract = "Sequence comparison is & fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A, B and characters a, b, compute LCS(aA, B), LCS(A, bB), LCS(Aa, B), and LCS(A, Bb), provided that L = LCS(A, B) is already computed. We present an efficient algorithm that computes the four LCS values above, in O(L) or O(n) time depending on where a new character is added, where n is the length of A. Our algorithm is superior in both time and space complexities to the previous known methods.",
author = "Yusuke Ishida and Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda",
year = "2005",
language = "English",
volume = "3623",
pages = "563--574",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Fully incremental LCS computation

AU - Ishida, Yusuke

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

PY - 2005

Y1 - 2005

N2 - Sequence comparison is & fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A, B and characters a, b, compute LCS(aA, B), LCS(A, bB), LCS(Aa, B), and LCS(A, Bb), provided that L = LCS(A, B) is already computed. We present an efficient algorithm that computes the four LCS values above, in O(L) or O(n) time depending on where a new character is added, where n is the length of A. Our algorithm is superior in both time and space complexities to the previous known methods.

AB - Sequence comparison is & fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A, B and characters a, b, compute LCS(aA, B), LCS(A, bB), LCS(Aa, B), and LCS(A, Bb), provided that L = LCS(A, B) is already computed. We present an efficient algorithm that computes the four LCS values above, in O(L) or O(n) time depending on where a new character is added, where n is the length of A. Our algorithm is superior in both time and space complexities to the previous known methods.

UR - http://www.scopus.com/inward/record.url?scp=26844489395&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844489395&partnerID=8YFLogxK

M3 - Article

VL - 3623

SP - 563

EP - 574

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -