The longest common subsequence problem -- a finite automata approach

DOI10.1007/3-540-45089-0_27MaRDI QIDQ3559786zbMATH OpenOpenAlexFDO

Authors Tomáš Polcar, Bořivoj Melichar

Publication date 7 May 2010

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45089-0_27

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Recommendations

• A new efficient algorithm for computing the longest common subsequence
• A New Efficient Algorithm for Computing the Longest Common Subsequence
• scientific article; zbMATH DE number 5545474
• scientific article; zbMATH DE number 88968
• Publication:4862293

Cited in

(9)

• A new efficient algorithm for computing the longest common subsequence
• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
• Finite automata based algorithms on subsequences and supersequences of degenerate strings
• A specialized branching and fathoming technique for the longest common subsequence problem
• String Processing and Information Retrieval
• A New Efficient Algorithm for Computing the Longest Common Subsequence
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
• scientific article; zbMATH DE number 88968 (Why is no real title available?)
• scientific article; zbMATH DE number 1962790 (Why is no real title available?)

This page was built for publication: The longest common subsequence problem -- a finite automata approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3559786)