Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications (Q1776373): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Algorithms - ESA 2003 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4410125 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-time algorithm for finding a maximum-density segment of a sequence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pattern recognition in genetic sequences by mismatch density / rank | |||
Normal rank | |||
Revision as of 10:14, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications |
scientific article |
Statements
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications (English)
0 references
12 May 2005
0 references
bioinformatics
0 references
sequences
0 references
density
0 references
0 references
