Sciweavers

86 search results - page 12 / 18
» DNA Models and Algorithms for NP-Complete Problems
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
ICML
2004
IEEE
14 years 8 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
CIBCB
2005
IEEE
14 years 1 months ago
Predicting Single Genes Related to Immune-Relevant Processes
— In this paper we address the problem of predicting gene activities by finding gene regulatory dependencies in experimental DNA microarray data. Only few approaches to infer th...
Christian Spieth, Felix Streichert, Nora Speer, Ch...
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 7 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 7 months ago
Finding Sequential Patterns from Large Sequence Data
Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mini...
Mahdi Esmaeili, Fazekas Gabor