A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences (Q1861731): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Multiple DNA and protein sequence alignment based on segment-to-segment comparison. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4532058 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polyhedral approach to sequence alignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-space algorithms that build local alignments from fragments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sparse dynamic programming I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear space algorithm for computing maximal common subsequences / rank | |||
Normal rank | |||
Revision as of 13:24, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences |
scientific article |
Statements
A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences (English)
0 references
10 March 2003
0 references
sequence alignment
0 references
string algorithm
0 references
fragment chaining
0 references
dynamic programming
0 references
complexity
0 references
