|
|
Parallelized approximation algorithms for minimum routing cost spanning trees
– Ching-lueh Chang, Yuh-dauh Lyuu
- 705
|
|
2
|
Selected Topics in Computational Biology
– Bhaskar Dasgupta, Lusheng Wang
- 1998
|
|
|
SALSA: Sequence ALignment via Steiner Ancestors
– Giuseppe Lancia, R. Ravi
|
|
6
|
Improving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment
– J. Stoye, S. W. Perrey, A. W. M. Dress
- 1997
|
|
|
Protein Multiple Sequence Alignment
– Chuong B. Do, Kazutaka Katoh
|
|
|
Algorithms on Constrained Sequence Alignment
– Ho Ngai Lam
- 2004
|
|
216
|
A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics
– Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
- 2003
|
|
|
Multiple Sequence Comparison and HMMs
– Christian N. S. Pedersen
- 2001
|
|
8
|
Near Optimal Multiple Alignment Within a Band In Polynomial Time
– Ming Li, Bin Ma, Lusheng Wang
- 2000
|
|
|
Exact Multiple Sequence Alignment
– Matthew Paul McNaughton
- 2003
|
|
5
|
Near Optimal Multiple Sequence Alignments using a Traveling Salesman Problem approach
– Chantal Korostensky, Gaston Gonnet
- 1999
|
|
4
|
GESTALT: Genomic Steiner Alignments
– Giuseppe Lancia, R. Ravi
- 1999
|
|
222
|
On Approximating Arbitrary Metrics by Tree Metrics
– Yair Bartal
- 1998
|
|
21
|
Finding Similar Regions in Many Sequences
– Ming Li, Bin Ma, Lusheng Wang
- 1999
|
|
3
|
A tight upper bound on the probabilistic embedding of seriesparallel graphs
– Yuval Emek, David Peleg
- 2006
|
|
17
|
Cuts, Trees and l 1 -Embeddings of Graphs
– Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
|
|
72
|
Approximating a Finite Metric by a Small Number of Tree Metrics
– M. Charikar, C. Chekuri, A. Goel, S. Guha, S. Plotkin
- 1998
|
|
1
|
Multiple Comparison in Biology : Some Mathematical Formalizations of the Problem and Combinatorial Approaches to Solve It
– M. -f. Sagot, A. Viari, J. Pothier, V. Escalier, H. Soldano, Atelier De Bioinformatique
- 1995
|
|
3
|
Non-approximability of weighted multiple sequence alignment
– Bodo Manthey
- 2003
|