Sciweavers

192 search results - page 36 / 39
» Genome rearrangements with duplications
Sort
View
RECOMB
2007
Springer
15 years 10 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
15 years 4 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough
SNPD
2004
14 years 11 months ago
Prediction of Protein Dispensability through Integrated Analysis of Multiple-Source High-Throughput Data
Protein dispensability is fundamental to understanding of gene function and evolution. It is usually studied at the individual gene phenotype level. Recent advances in generating ...
Yu Chen, Dong Xu
BMCBI
2010
113views more  BMCBI 2010»
14 years 10 months ago
A classification model for distinguishing copy number variants from cancer-related alterations
Background: Both somatic copy number alterations (CNAs) and germline copy number variants (CNVs) that are prevalent in healthy individuals can appear as recurrent changes in compa...
Irina Ostrovnaya, Gouri Nanjangud, Adam B. Olshen
BMCBI
2008
113views more  BMCBI 2008»
14 years 10 months ago
SynBlast: Assisting the analysis of conserved synteny information
Motivation: In the last years more than 20 vertebrate genomes have been sequenced, and the rate at which genomic DNA information becomes available is rapidly accelerating. Gene du...
Jörg Lehmann, Peter F. Stadler, Sonja J. Proh...