The University of Southampton
×
Filter your search:
University of Southampton Institutional Repository

The longest common subsequence problem a finite automata approach

The longest common subsequence problem a finite automata approach
The longest common subsequence problem a finite automata approach

A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in φ (|A|(|S1| + |S2| + Σa∈A|S1|a|S2|S 2|a)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and |Si|a is the number of occurrences of a ∈ A in Si.

0302-9743
294-296
Springer
Melichar, Bořivoj
a433de23-9c88-4307-8446-13479c19cfc4
Polcar, Tomáš
c669b663-3ba9-4e7b-9f97-8ef5655ac6d2
Ibarra, Oscar H.
Dang, Zhe
Melichar, Bořivoj
a433de23-9c88-4307-8446-13479c19cfc4
Polcar, Tomáš
c669b663-3ba9-4e7b-9f97-8ef5655ac6d2
Ibarra, Oscar H.
Dang, Zhe

Melichar, Bořivoj and Polcar, Tomáš (2003) The longest common subsequence problem a finite automata approach. In, Ibarra, Oscar H. and Dang, Zhe (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2759) Springer, pp. 294-296. (doi:10.1007/3-540-45089-0_27).

Record type: Book Section

Abstract

A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in φ (|A|(|S1| + |S2| + Σa∈A|S1|a|S2|S 2|a)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and |Si|a is the number of occurrences of a ∈ A in Si.

This record has no associated files available for download.

More information

Published date: 2003
Additional Information: Copyright: Copyright 2020 Elsevier B.V., All rights reserved.

Identifiers

Local EPrints ID: 454152
URI: http://eprints.soton.ac.uk/id/eprint/454152
DOI: doi:10.1007/3-540-45089-0_27
ISSN: 0302-9743
PURE UUID: 92cb446d-3473-45e6-ba75-df3307d663a4
ORCID for Tomáš Polcar: ORCID iD orcid.org/0000-0002-0863-6287

Catalogue record

Date deposited: 01 Feb 2022 17:43
Last modified: 17 Mar 2024 03:26

Export record

Altmetrics

Contributors

Author: Bořivoj Melichar
Author: Tomáš Polcar ORCID iD
Editor: Oscar H. Ibarra
Editor: Zhe Dang

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Library staff additional information
Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×