Sciweavers

205 search results - page 13 / 41
» Incomparability of Results Between Phylogenetic Search Progr...
Sort
View
LPNMR
2001
Springer
15 years 1 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
ICGA
1993
145views Optimization» more  ICGA 1993»
14 years 10 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
WWW
2007
ACM
15 years 10 months ago
Search engines and their public interfaces: which apis are the most synchronized?
Researchers of commercial search engines often collect data using the application programming interface (API) or by "scraping" results from the web user interface (WUI),...
Frank McCown, Michael L. Nelson
BMCBI
2006
103views more  BMCBI 2006»
14 years 9 months ago
Cis-motifs upstream of the transcription and translation initiation sites are effectively revealed by their positional disequili
Background: The discovery of cis-regulatory motifs still remains a challenging task even though the number of sequenced genomes is constantly growing. Computational analyses using...
Kenneth W. Berendzen, Kurt Stüber, Klaus Hart...
106
Voted
BMCBI
2005
132views more  BMCBI 2005»
14 years 9 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer