CPM
2010
Springer
14 years 8 days ago
2010
Springer
CPM
2010
Springer
14 years 8 days ago
2010
Springer
CPM
2010
Springer
14 years 8 days ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
CPM
2010
Springer
14 years 8 days ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
CPM
2010
Springer
14 years 8 days ago
2010
Springer
CPM
2010
Springer
14 years 8 days ago
2010
Springer
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer arra...
CPM
2010
Springer
14 years 8 days ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
CPM
2010
Springer
14 years 8 days ago
2010
Springer
CPM
2010
Springer
14 years 8 days ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
CPM
2010
Springer
14 years 8 days ago
2010
Springer