Sciweavers

445 search results - page 63 / 89
» bioinformatics 2005
Sort
View
WABI
2005
Springer
15 years 3 months ago
Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity
We present recent developments in efficiently maintaining the boundary and surface area of protein molecules as they undergo conformational changes. As the method that we devised k...
Eran Eyal, Dan Halperin
DNA
2005
Springer
134views Bioinformatics» more  DNA 2005»
15 years 3 months ago
Complexity of Compact Proofreading for Self-assembled Patterns
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...
David Soloveichik, Erik Winfree
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
15 years 3 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
WOB
2004
134views Bioinformatics» more  WOB 2004»
14 years 11 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
WABI
2005
Springer
128views Bioinformatics» more  WABI 2005»
15 years 3 months ago
Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event
Abstract. The haplotype inference (HI) problem is the problem of inferring 2n haplotype pairs from n observed genotype vectors. This is a key problem that arises in studying geneti...
Yun S. Song, Yufeng Wu, Dan Gusfield