Unbalanced translocations take place when two unequal chromosome sub-sequences swap, resulting in an altered genetic sequence. Such large-scale gene modification are among the most frequent chromosomal alterations, accounted for 30% of all losses of heterozygosity. However, despite of their central role in genomic sequence analysis, little attention has been devoted to the problem of aligning sequences allowing for this kind of modification. In this paper we investigate the sequence alignment problem when the edit operations are non-overlapping unbalanced translocations of adjacent factors. Specifically, we present an alignment algorithm for the problem working in $$\mathcal {O}(m^3)$$ -time and $$\mathcal {O}(m^3)$$ -space, where m is the length of the involved sequences. To the best of our knowledge this is the first solution in literature for the alignment problem allowing for unbalanced translocations of factors.
Faro S., Pavone A. (2019). Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors. In Bioinformatics and Biomedical Engineering 7th International Work-Conference, IWBBIO 2019, Granada, Spain, May 8-10, 2019, Proceedings, Part I (pp. 120-131). GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND : Springer Verlag [10.1007/978-3-030-17938-0_12].
Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors
Pavone A.
2019-01-01
Abstract
Unbalanced translocations take place when two unequal chromosome sub-sequences swap, resulting in an altered genetic sequence. Such large-scale gene modification are among the most frequent chromosomal alterations, accounted for 30% of all losses of heterozygosity. However, despite of their central role in genomic sequence analysis, little attention has been devoted to the problem of aligning sequences allowing for this kind of modification. In this paper we investigate the sequence alignment problem when the edit operations are non-overlapping unbalanced translocations of adjacent factors. Specifically, we present an alignment algorithm for the problem working in $$\mathcal {O}(m^3)$$ -time and $$\mathcal {O}(m^3)$$ -space, where m is the length of the involved sequences. To the best of our knowledge this is the first solution in literature for the alignment problem allowing for unbalanced translocations of factors.File | Dimensione | Formato | |
---|---|---|---|
Pubblicazione 2019 - IWBBIO.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
414.89 kB
Formato
Adobe PDF
|
414.89 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.