Sciweavers

452 search results - page 29 / 91
» Gene finding in novel genomes
Sort
View
JDA
2008
122views more  JDA 2008»
13 years 7 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
BMCBI
2006
116views more  BMCBI 2006»
13 years 8 months ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...
APBC
2004
164views Bioinformatics» more  APBC 2004»
13 years 9 months ago
Cluster Ensemble and Its Applications in Gene Expression Analysis
Huge amount of gene expression data have been generated as a result of the human genomic project. Clustering has been used extensively in mining these gene expression data to find...
Xiaohua Hu, Illhoi Yoo
BMCBI
2008
111views more  BMCBI 2008»
13 years 8 months ago
Information-based methods for predicting gene function from systematic gene knock-downs
Background: The rapid annotation of genes on a genome-wide scale is now possible for several organisms using high-throughput RNA interference assays to knock down the expression o...
Matthew T. Weirauch, Christopher K. Wong, Alexandr...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 9 months ago
Finding Time-Lagged 3D Clusters
Existing 3D clustering algorithms on gene ? sample ? time expression data do not consider the time lags between correlated gene expression patterns. Besides, they either ignore the...
Xin Xu, Ying Lu, Kian-Lee Tan, Anthony K. H. Tung