Search research articles
Contact Us
Filters
Showing results (1-10 of 4) with videos related to
Page
of 1
Sort By:
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
January 1, 1995
A simplified proof of the NP- and MAX SNP-hardness of multiple sequence tree alignment
H T Wareham
Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|
March 27, 2001
Exact algorithms for computing pairwise alignments and 3-medians from structure-annotated sequences (extended abstract)
P A Evans, H T Wareham
Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|
July 21, 2000
Stochastic heuristic algorithms for target motif identification (extended abstract)
H T Wareham, T Jiang, X Zhang, et al.
Computer Applications in the Biosciences : CABIOS
|
February 1, 1995
Parameterized complexity analysis in computational biology
H L Bodlaender, R G Downey, M R Fellows, et al.
Page
of 1
Search research articles
Search
Showing results (1-10 of 4) with videos related to
Sort By:
Page
of 1
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
January 1, 1995
A simplified proof of the NP- and MAX SNP-hardness of multiple sequence tree alignment
H T Wareham
Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|
March 27, 2001
Exact algorithms for computing pairwise alignments and 3-medians from structure-annotated sequences (extended abstract)
P A Evans, H T Wareham
Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|
July 21, 2000
Stochastic heuristic algorithms for target motif identification (extended abstract)
H T Wareham, T Jiang, X Zhang, et al.
Computer Applications in the Biosciences : CABIOS
|
February 1, 1995
Parameterized complexity analysis in computational biology
H L Bodlaender, R G Downey, M R Fellows, et al.
Page
of 1