Sciweavers

729 search results - page 72 / 146
» Computing persistent homology
Sort
View
JCC
2007
131views more  JCC 2007»
14 years 9 months ago
An extended dead-end elimination algorithm to determine gap-free lists of low energy states
: Proteins are flexible systems and commonly populate several functionally important states. To understand protein function, these states and their energies have to be identified...
Edda Kloppmann, G. Matthias Ullmann, Torsten Becke...
BIOINFORMATICS
2004
86views more  BIOINFORMATICS 2004»
14 years 9 months ago
Transposable element annotation of the rice genome
Motivation: The high content of repetitive sequences in the genomes of many higher eukaryotes renders the task of annotating them computationally intensive. Presently, the only wi...
Nikoleta Juretic, Thomas E. Bureau, Richard M. Bru...
RECOMB
2010
Springer
14 years 7 months ago
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
Jean-Philippe Doyon, Celine Scornavacca, K. Yu. Go...
SAC
2010
ACM
15 years 4 months ago
Infrastructureless storage in dynamic environments
This paper studies the use of highly dynamic networks as infrastructures for persistent storage of data that offer services at specific geographical zones in a decentralized and...
Jose Luis Fernandez-Marquez, Josep Lluís Ar...
ICRA
2008
IEEE
118views Robotics» more  ICRA 2008»
15 years 4 months ago
HLS parameter estimation for multi-input multi-output systems
Abstract— In order to reduce computational burden of identification methods for multivariable systems, a hierarchical least squares (HLS) algorithm is developed. The basic idea ...
Ping Yuan, Feng Ding, Peter X. Liu