Università di Pisa
Sistema bibliotecario di ateneo

Fast calculation of a segment mutation distance between long sequences

Felicioli, C. (2004) Fast calculation of a segment mutation distance between long sequences. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (748Kb)


    BpMatch is a new algorithm whose function is to efficiently calculate, from sequences S and T, the maximum coverage of T using only subsequences and complemented reversed subsequences of S, with minimum length l, possibly overlapped, and, in such a maximum coverage, to minimize the number of subsequences used. The problem is solved by executing a preelaboration of S (independently from the sequence on which a maximum coverage will be later looked for, and therefore executed only once for any target sequence T), generating a graph which allows a fast recognizing of S's subsequences. Graphs G and G' must be generated from S and complemented reversed S, then, using G, G' and T, calculus of the maximum coverage can be computed in linear space and time.

    Item Type: Book
    Uncontrolled Keywords: Sequence distance, segment mutation, computational biology, analysis of algorithms
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 09 Dec 2014 10:48
    Last Modified: 09 Dec 2014 10:48
    URI: http://eprints.adm.unipi.it/id/eprint/2120

    Repository staff only actions

    View Item