Sciweavers

26 search results - page 3 / 6
» recomb 2001
Sort
View
RECOMB
2001
Springer
14 years 6 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
RECOMB
2001
Springer
14 years 6 months ago
Applications of generalized pair hidden Markov models to alignment and gene finding problems
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
Lior Pachter, Marina Alexandersson, Simon Cawley
RECOMB
2001
Springer
13 years 10 months ago
The greedy path-merging algorithm for sequence assembly
Two different approaches to determining the human genome are currently being pursued: one is the “clone-by-clone” approach, employed by the publicly-funded Human Genome Proje...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
RECOMB
2001
Springer
14 years 6 months ago
Towards predicting coiled-coil protein interactions
Protein-protein interactions play a central role in many cellular functions, and as whole-genome data accumulates, computational methods for predicting these interactions become i...
Mona Singh, Peter S. Kim
RECOMB
2001
Springer
13 years 10 months ago
Edit distance between two RNA structures
The primary structure of a ribonucleic acid (RNA) molecule is a sequence of nucleotides (bases) over the four-letter alphabet fA; C; G; Ug. The secondary or tertiary structure of ...
Guohui Lin, Bin Ma, Kaizhong Zhang