Sciweavers

2877 search results - page 286 / 576
» Computational Biology
Sort
View
187
Voted
ISAAC
2003
Springer
70views Algorithms» more  ISAAC 2003»
15 years 12 months ago
Settling the Intractability of Multiple Alignment
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
Isaac Elias
IJCAI
2003
15 years 8 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf
ICML
2010
IEEE
15 years 7 months ago
On Sparse Nonparametric Conditional Covariance Selection
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...
Mladen Kolar, Ankur P. Parikh, Eric P. Xing
SIAMCOMP
2008
121views more  SIAMCOMP 2008»
15 years 6 months ago
Closest Substring Problems with Small Distances
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
Dániel Marx
ACMSE
2006
ACM
16 years 20 days ago
Reconstructing networks using co-temporal functions
Reconstructing networks from time series data is a difficult inverse problem. We apply two methods to this problem using co-temporal functions. Co-temporal functions capture mathe...
Edward E. Allen, Anthony Pecorella, Jacquelyn S. F...