250 search results - page 24 / 50 » Linear Text Segmentation using a Dynamic Programming Algorit... |
BMCBI
2008
13 years 8 months ago
2008
Background: At intermediate stages of genome assembly projects, when a number of contigs have been generated and their validity needs to be verified, it is desirable to align thes...
IJCAI
2007
13 years 9 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
CODES
2004
IEEE
13 years 11 months ago
2004
IEEE
The memory subsystem accounts for a significant portion of the aggregate energy budget of contemporary embedded systems. Moreover, there exists a large potential for optimizing th...
LATIN
1998
Springer
14 years 3 days ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
EVOW
2005
Springer
14 years 1 months ago
2005
Springer
This paper reports on steps that have been taken to enhance previously presented evolutionary sound matching work. In doing so, the convergence characteristics are shown to provide...