Sciweavers

22168 search results - page 101 / 4434
» Computation in Gene Networks
Sort
View
RECOMB
2012
Springer
13 years 11 days ago
A Model for Biased Fractionation after Whole Genome Duplication
Background: Paralog reduction, the loss of duplicate genes after whole genome duplication (WGD) is a pervasive process. Whether this loss proceeds gene by gene or through deletion...
David Sankoff, Chunfang Zheng, Baoyong Wang
RECOMB
2006
Springer
15 years 10 months ago
Genome-Wide Discovery of Modulators of Transcriptional Interactions in Human B Lymphocytes
Abstract. Transcriptional interactions in a cell are modulated by a variety of mechanisms that prevent their representation as pure pairwise interactions between a transcription fa...
Kai Wang, Ilya Nemenman, Nilanjana Banerjee, Adam ...
IJFCS
2006
130views more  IJFCS 2006»
14 years 10 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
15 years 3 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson