Sciweavers

621 search results - page 92 / 125
» DNA Computing
Sort
View
BIOINFORMATICS
2004
86views more  BIOINFORMATICS 2004»
13 years 7 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...
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 11 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
TCBB
2011
13 years 2 months ago
Information-Theoretic Model of Evolution over Protein Communication Channel
—In this paper, we propose a communication model of evolution and investigate its information-theoretic bounds. The process of evolution is modeled as the retransmission of infor...
Liuling Gong, Nidhal Bouaynaya, Dan Schonfeld
ICPR
2004
IEEE
14 years 8 months ago
Missing Microarray Data Estimation Based on Projection onto Convex Sets Method
DNA microarrays have gained widespread uses in biological studies. Missing values in a microarray experiment must be estimated before further analysis. In this paper, we propose a...
Alan Wee-Chung Liew, Hong Yan, Xiangchao Gan
RECOMB
2009
Springer
14 years 8 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...