Sciweavers

144 search results - page 28 / 29
» The evolutionary computation approach to motif discovery in ...
Sort
View
BMCBI
2011
13 years 17 days ago
Motif-guided sparse decomposition of gene expression data for regulatory module identification
Background: Genes work coordinately as gene modules or gene networks. Various computational approaches have been proposed to find gene modules based on gene expression data; for e...
Ting Gong, Jianhua Xuan, Li Chen, Rebecca B. Riggi...
RECOMB
2010
Springer
13 years 7 months ago
Algorithms for Detecting Significantly Mutated Pathways in Cancer
Abstract. Recent genome sequencing studies have shown that the somatic mutations that drive cancer development are distributed across a large number of genes. This mutational heter...
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
RECOMB
2006
Springer
14 years 5 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
JCB
2007
146views more  JCB 2007»
13 years 5 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
BMCBI
2007
126views more  BMCBI 2007»
13 years 5 months ago
High-throughput identification of interacting protein-protein binding sites
Background: With the advent of increasing sequence and structural data, a number of methods have been proposed to locate putative protein binding sites from protein surfaces. Ther...
Jo-Lan Chung, Wei Wang, Philip E. Bourne