64 search results - page 6 / 13 » Analysis of evolutionary algorithms for the longest common s... |
IEEESCC
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
BMCBI
2006
13 years 7 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
IWPEC
2004
Springer
14 years 21 days ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
FCT
2005
Springer
14 years 26 days 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...
IFIP
2004
Springer
14 years 21 days ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...