Sciweavers

1348 search results - page 150 / 270
» From Informatics to Bioinformatics
Sort
View
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
14 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...
WABI
2005
Springer
128views Bioinformatics» more  WABI 2005»
14 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
WABI
2005
Springer
109views Bioinformatics» more  WABI 2005»
14 years 3 months ago
Optimal Protein Threading by Cost-Splitting
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
DNA
2004
Springer
165views Bioinformatics» more  DNA 2004»
14 years 3 months ago
Computing by Observing Bio-systems: The Case of Sticker Systems
Abstract. A very common approach in chemistry and biology is to observe the progress of an experiment, and take the result of this observation as the final output. Inspired by thi...
Artiom Alhazov, Matteo Cavaliere
DNA
2004
Springer
168views Bioinformatics» more  DNA 2004»
14 years 3 months ago
Biomolecular Implementation of Computing Devices with Unbounded Memory
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
Matteo Cavaliere, Natasa Jonoska, Sivan Yogev, Ron...