Standard compression algorithms are not able to compress DNA sequences. Recently, new algorithms have been introduced specifically for this purpose, often using detection of long approximate repeats.â€¦ (More)

In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of k alphanumeric termsâ€¦ (More)

One of the most important objects in genetic mapping and forensic studies are minisatellite consist of a heterogeneous tandem array of short repeat units called variants. The evolution satellites isâ€¦ (More)

Inferring positional homologs with common intervals of sequences On genome evolution with accumulated change and innovation Sorting by translocations via reversals theory Michal Ozery-Flato and Ronâ€¦ (More)

Subsequent duplication events are responsible for the evolution of the minisatellite maps. Alignment of two minisatellite maps should therefore take these duplication events into account, in additionâ€¦ (More)

MOTIVATION
A k-point mutant of a given RNA sequence s = s(1), ..., s(n) is an RNA sequence s' = s'(1),..., s'(n) obtained by mutating exactly k-positions in s; i.e. Hamming distance between s and s'â€¦ (More)

In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(nâ€² + mâ€² + mnâ€² + nmâ€² + mn) where n and m are the lengths of the maps and nâ€² and mâ€² are theâ€¦ (More)

MOTIVATION
S-attributed grammars (a generalization of classical Context-Free grammars) provide a versatile formalism for sequence analysis which allows to express long range constraints: the RNAâ€¦ (More)