DMCA
A Simplified Proof of the NP- and MAX SNP-hardness of Multiple Sequence Tree Alignment (1995)
by
H. Todd Wareham
| Venue: | Journal of Computational Biology |
| Citations: | 7 - 0 self |
BibTeX
@ARTICLE{Wareham95asimplified,
author = {H. Todd Wareham},
title = {A Simplified Proof of the NP- and MAX SNP-hardness of Multiple Sequence Tree Alignment},
journal = {Journal of Computational Biology},
year = {1995},
volume = {2},
pages = {51--4}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
this paper has one or more columns composed purely of indels. The cost of an alignment is generally computed relative to a given \Gamma \Theta \Gamma symmetric matrix
