148 search results - page 8 / 30 » Linear Time Algorithm for the Longest Common Repeat Problem |
ICALP
2001
Springer
14 years 9 days ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
BMCBI
2006
13 years 7 months ago
2006
Background: Many genome projects are left unfinished due to complex, repeated regions. Finishing is the most time consuming step in sequencing and current finishing tools are not ...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
TCBB
2010
13 years 6 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...
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...