Constrained sequence analysis algorithms in computational biology

DOI10.1016/j.ins.2014.10.019zbMath1360.68962OpenAlexW2068017610MaRDI QIDQ527151

Effat Farhana, M. Sohel Rahman

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.10.019

zbMATH Keywords

algorithmsequence analysisfinite automaton

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Related Items (2)

A hardness result and new algorithm for the longest common palindromic subsequence problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hyper-heuristic for the longest common subsequence problem
• On the generalized constrained longest common subsequence problems
• String processing and information retrieval. 17th international symposium, SPIRE 2010, Los Cabos, Mexico, October 11--13, 2010. Proceedings
• A new efficient algorithm for computing the longest common subsequence
• Beam search for the longest common subsequence problem
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization
• New efficient algorithms for the LCS and constrained LCS problems
• Finite automata based algorithms on subsequences and supersequences of degenerate strings
• The constrained longest common subsequence problem
• The longest common subsequence problem revisited
• A faster algorithm computing string edit distances
• An improved algorithm for the longest common subsequence problem
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• A simple algorithm for the constrained sequence problems
• An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
• Constrained LCS: Hardness and Approximation
• 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
• Automatic Sequences
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
• Longest common subsequences
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS

This page was built for publication: Constrained sequence analysis algorithms in computational biology