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

DOI10.1155/2012/310328zbMath1264.68222OpenAlexW1965689044WikidataQ58911416 ScholiaQ58911416MaRDI QIDQ1954643

Yuping Wang, Liang Bao, Yan-Ni 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

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• MapReduce

Cites Work

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

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