Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. (Q1872726)
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 locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. |
scientific article; zbMATH DE number 1910850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. |
scientific article; zbMATH DE number 1910850 |
Statements
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. (English)
0 references
14 May 2003
0 references
Algorithm
0 references
Efficiency
0 references
Maximum consecutive subsequence
0 references
Length constraint
0 references
Biomolecular sequence analysis
0 references
Ungapped local alignment
0 references
