Sciweavers

1522 search results - page 5 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
BMCBI
2004
133views more  BMCBI 2004»
13 years 7 months ago
Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
Robin D. Dowell, Sean R. Eddy
BMCBI
2007
153views more  BMCBI 2007»
13 years 7 months ago
Estimating genealogies from linked marker data: a Bayesian approach
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...
Dario Gasbarra, Matti Pirinen, Mikko J. Sillanp&au...
EXPCS
2007
13 years 11 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne
BCB
2010
161views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...
EOR
2008
84views more  EOR 2008»
13 years 7 months ago
Complexity of local search for the p-median problem
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...