Constrained sequence analysis algorithms in computational biology (Q527151)

From MaRDI portal

Revision as of 20:19, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Constrained sequence analysis algorithms in computational biology	scientific article

Statements

scholarly article

0 references

Constrained sequence analysis algorithms in computational biology (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.ins.2014.10.019

0 references

0 references

M. Sohel Rahman

0 references

Information Sciences

0 references

publication date

16 May 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

sequence analysis

0 references

algorithm

0 references

finite automaton

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ins.2014.10.019

0 references

0 references

Automatic Sequences

0 references

The longest common subsequence problem revisited

0 references

ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS

0 references

Beam search for the longest common subsequence problem

0 references

On the generalized constrained longest common subsequence problems

0 references

A simple algorithm for the constrained sequence problems

0 references

0 references

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

0 references

0 references

0 references

String processing and information retrieval. 17th international symposium, SPIRE 2010, Los Cabos, Mexico, October 11--13, 2010. Proceedings

0 references

Constrained LCS: Hardness and Approximation

0 references

0 references

A fast algorithm for computing longest common subsequences

0 references

New efficient algorithms for the LCS and constrained LCS problems

0 references

A new efficient algorithm for computing the longest common subsequence

0 references

0 references

Finite automata based algorithms on subsequences and supersequences of degenerate strings

0 references

The Complexity of Some Problems on Subsequences and Supersequences

0 references

A faster algorithm computing string edit distances

0 references

An improved algorithm for the longest common subsequence problem

0 references

Longest common subsequences

0 references

Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem

0 references

Finding the longest common subsequence for multiple biological sequences by ant colony optimization

0 references

A hyper-heuristic for the longest common subsequence problem

0 references

0 references

The constrained longest common subsequence problem

0 references

Efficient algorithms for the longest common subsequence problem with sequential substring constraints

0 references

Bounds on the Complexity of the Longest Common Subsequence Problem

0 references

The String-to-String Correction Problem

0 references

An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:527151

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q527151&oldid=36321492"