Near optimal multiple alignment within a band in polynomial time

Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band ( c-diagonal) is a popular practice in bioinformatics with good practical results [D. Sankoff, J. Kruskal, Time Warps, String Edits, and Mac...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 73; no. 6; pp. 997 - 1011
Main Authors:	Ma, Bin, Wang, Lusheng, Li, Ming
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.09.2007
Subjects:	Multiple sequence alignment within a band Polynomial time approximation algorithms Multiple sequence alignment within a band Polynomial time approximation algorithms
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!