Efficient algorithms for the longest common subsequence problem with sequential substring constraints (Q1931428)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for the longest common subsequence problem with sequential substring constraints |
scientific article; zbMATH DE number 6125280
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the longest common subsequence problem with sequential substring constraints |
scientific article; zbMATH DE number 6125280 |
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
0.96240157
0 references
0.9588007
0 references
0.9425677
0 references
0.93916446
0 references
0.9391644
0 references
0.93390524
0 references
0.9338746
0 references
