Efficient algorithms for the longest common subsequence problem with sequential substring constraints (Q1931428)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the longest common subsequence problem with sequential substring constraints |
scientific article |
Statements
Efficient algorithms for the longest common subsequence problem with sequential substring constraints (English)
0 references
14 January 2013
0 references
algorithm design
0 references
bioinformatics
0 references
longest common subsequence
0 references
constrained LCS
0 references
sequential substring
0 references
