224 search results - page 11 / 45 » The Complexity of Phrase Alignment Problems |
CPM
2003
Springer
14 years 4 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
IJCNN
2006
IEEE
14 years 5 months ago
2006
IEEE
— The applicability of complex networks of spiking neurons as a general purpose machine learning technique remains open. Building on previous work using macroscopic exploration o...
AAAI
2000
14 years 9 days ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
JAT
2010
13 years 5 months ago
2010
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
TCBB
2010
13 years 9 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...