Sciweavers

956 search results - page 141 / 192
» A structural approach to latency prediction
Sort
View
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
EVOW
2004
Springer
14 years 1 months ago
Evolving Regular Expression-Based Sequence Classifiers for Protein Nuclear Localisation
A number of bioinformatics tools use regular expression (RE) matching to locate protein or DNA sequence motifs that have been discovered by researchers in the laboratory. For exam...
Amine Heddad, Markus Brameier, Robert M. MacCallum
BMCBI
2004
108views more  BMCBI 2004»
13 years 10 months ago
Enhanced protein domain discovery using taxonomy
Background: It is well known that different species have different protein domain repertoires, and indeed that some protein domains are kingdom specific. This information has not ...
Lachlan James M. Coin, Alex Bateman, Richard Durbi...
IJPRAI
2002
93views more  IJPRAI 2002»
13 years 9 months ago
Improving Stability of Decision Trees
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
Mark Last, Oded Maimon, Einat Minkov
BMCBI
2007
134views more  BMCBI 2007»
13 years 10 months ago
Automatic generation of 3D motifs for classification of protein binding sites
Background: Since many of the new protein structures delivered by high-throughput processes do not have any known function, there is a need for structure-based prediction of prote...
Jean-Christophe Nebel, Pawel Herzyk, David R. Gilb...