Sciweavers

2877 search results - page 3 / 576

» Computational Biology

11

RECOMB
2008
Springer

221views Computational Biology» more RECOMB 2008»

More Efficient Algorithms for Closest String and Substring Problems

14 years 4 months ago

More Efficient Algorithms for Closest String and Substring Problems

Download itcs.tsinghua.edu.cn

Bin Ma, Xiaoming Sun

claim paper

Read More »

10

RECOMB
2005
Springer

110views Computational Biology» more RECOMB 2005»

Maximum Likelihood of Evolutionary Trees Is Hard

14 years 4 months ago

Maximum Likelihood of Evolutionary Trees Is Hard

Download www.cs.tau.ac.il

Benny Chor, Tamir Tuller

claim paper

Read More »

10

RECOMB
2004
Springer

94views Computational Biology» more RECOMB 2004»

Protein similarity from knot theory and geometric convolution

14 years 4 months ago

Protein similarity from knot theory and geometric convolution

Download reports-archive.adm.cs.cmu.edu

Michael Erdmann

claim paper

Read More »

12

RECOMB
2004
Springer

124views Computational Biology» more RECOMB 2004»

From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles

14 years 4 months ago

From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles

Download cseweb.ucsd.edu

Eleazar Eskin

claim paper

Read More »

11

RECOMB
2004
Springer

112views Computational Biology» more RECOMB 2004»

Reconciliation problems for duplication, loss and horizontal gene transfer

14 years 4 months ago

Reconciliation problems for duplication, loss and horizontal gene transfer

Download ai.stanford.edu

Pawel Górecki

claim paper

Read More »

« Prev « First page 3 / 576 Last » Next »