A New Efficient Algorithm for computing the Longest Common Subsequence

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

7 Citations (Scopus)


In this paper, we present a new and efficient algorithm for solving the LCS problem for two strings. Our algorithm runs in O(R log log n+n) time, where R is the total number of ordered pairs of positions at which the two strings match.
Original languageEnglish
Title of host publicationAlgorithmic Aspects in Information and Management
Subtitle of host publicationProceedings of the Third International Conference, AAIM 2007
EditorsMing-Yang Kao, Xiang-Yang Li
Place of PublicationBerlin and New York
PublisherSpringer Berlin Heidelberg
Number of pages9
Publication statusPublished - 1 Jun 2007

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
ISSN (Print)0302-9743


Dive into the research topics of 'A New Efficient Algorithm for computing the Longest Common Subsequence'. Together they form a unique fingerprint.

Cite this