Sciweavers

62 search results - page 8 / 13
» A New Approach to Exact Crossing Minimization
Sort
View
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
13 years 11 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
ICCAD
1993
IEEE
85views Hardware» more  ICCAD 1993»
14 years 3 hour ago
Input don't care sequences in FSM networks
Current approaches to compute and exploit the flexibility of a component in an FSM network are all at the symbolic level [23, 30, 33, 31]. Conventionally, exploitation of this ï¬...
Huey-Yih Wang, Robert K. Brayton
BMCBI
2010
112views more  BMCBI 2010»
13 years 8 months ago
A parameter-adaptive dynamic programming approach for inferring cophylogenies
Background: Coevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phy...
Daniel Merkle, Martin Middendorf, Nicolas Wieseke
WABI
2009
Springer
129views Bioinformatics» more  WABI 2009»
14 years 2 months ago
biRNA: Fast RNA-RNA Binding Sites Prediction
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
Hamidreza Chitsaz, Rolf Backofen, Süleyman Ce...
IJIT
2004
13 years 9 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case