FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search

DOI10.1155/2012/310328zbMATH Open1264.68222OpenAlexW1965689044WikidataQ58911416 ScholiaQ58911416MaRDI QIDQ1954643FDOQ1954643

Authors: Yuping Wang, Liang Bao, Yanni Li 

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/310328

Recommendations

• The longest common subsequence problem -- a finite automata approach
• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• Publication:4862293
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• Multivariate fine-grained complexity of longest common subsequence
• scientific article; zbMATH DE number 278833
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• A new efficient algorithm for computing the longest common subsequence
• A New Efficient Algorithm for Computing the Longest Common Subsequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Cites Work

• The String-to-String Correction Problem
• A faster algorithm computing string edit distances
• Efficient Parallel Algorithms for String Editing and Related Problems
• A linear space algorithm for computing maximal common subsequences
• On computing the length of longest increasing subsequences
• Enumerating longest increasing subsequences and patience sorting
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Faster Algorithms for Computing Longest Common Increasing Subsequences
• A fast algorithm for computing a longest common increasing subsequence
• Bounds on the Complexity of the Longest Common Subsequence Problem
• Parallel processing of biological sequence comparison algorithms

Cited In (1)

• A linear time complexity of breadth-first search using P system with membrane division

Uses Software

• MapReduce

This page was built for publication: FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search

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