10435 search results - page 168 / 2087 » Computational Biology and Language |
196
click to vote
COMPLEXITY
2010
15 years 3 months ago
2010
The increasing sophistication of the tools and results of cellular and molecular neuroscience would appear to suggest that explanatory force in neuroscience is defined by reductio...
163
click to vote
CIBCB
2005
IEEE
16 years 3 days ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
158
click to vote
NIPS
1998
15 years 7 months ago
1998
Symmetrically connected recurrent networks have recently been used as models of a host of neural computations. However, biological neural networks have asymmetrical connections, at...
175
click to vote
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
201
click to vote
WABI
2010
Springer
15 years 4 months ago
2010
Springer
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...