SIGN IN
SIGN UP
Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem
Full Text:
Pdf
Buy this Article
Authors:
C. Thach Nguyen
Nguyen Bao Nguyen
Wing-Kin Sung
Louxin Zhang
2007 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 166
· Citation Count: 2
Published in:
· Journal
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
TCBB Homepage
archive
Volume 4 Issue 3, July 2007
Pages 394-402
IEEE Computer Society Press
Los Alamitos, CA
, USA
table of contents
doi>
10.1109/tcbb.2007.1018
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
analysis of algorithms
biology and genetics
combination network, phylogenetic network, parsimony method, np-hardness, approximability, dynamic programming
design
dynamic programming
performance
reducibility and completeness
theory
trees
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder