Sciweavers

557 search results - page 110 / 112
» dna 2007
Sort
View
AI
2010
Springer
13 years 5 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
EC
2007
160views ECommerce» more  EC 2007»
13 years 5 months ago
Agent-Based Model of Genotype Editing
Evolutionary algorithms rarely deal with ontogenetic, non-inherited alteration of genetic information because they are based on a direct genotype-phenotype mapping. In contrast, i...
Chien-Feng Huang, Jasleen Kaur, Ana Gabriela Magui...
TCS
2008
13 years 5 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
BMCBI
2008
214views more  BMCBI 2008»
13 years 3 months ago
Enhanced Bayesian modelling in BAPS software for learning genetic structures of populations
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...
Jukka Corander, Pekka Marttinen, Jukka Siré...
BMCBI
2007
107views more  BMCBI 2007»
13 years 5 months ago
antiCODE: a natural sense-antisense transcripts database
Background: Natural antisense transcripts (NATs) are endogenous RNA molecules that exhibit partial or complete complementarity to other RNAs, and that may contribute to the regula...
Yifei Yin, Yi Zhao, Jie Wang, Changning Liu, Shugu...