An approximation algorithm for alignment of multiple sequences using motif discovery (Q1306405)
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: An approximation algorithm for alignment of multiple sequences using motif discovery |
scientific article; zbMATH DE number 1347177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for alignment of multiple sequences using motif discovery |
scientific article; zbMATH DE number 1347177 |
Statements
An approximation algorithm for alignment of multiple sequences using motif discovery (English)
0 references
20 May 2001
0 references
multiple sequence alignment
0 references
alignment number
0 references
protein sequences
0 references
motif discovery
0 references
MAX SNP hard
0 references
approximate algorithm
0 references
set covering problem
0 references
0.92203915
0 references
0.91477025
0 references
0.90508753
0 references
0.8970642
0 references
0.89582306
0 references
0.89482987
0 references
