Reconstructing the Duplication History of a Tandem Repeat
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Graph Clustering Via a Discrete Uncoupling Process
SIAM Journal on Matrix Analysis and Applications
Improved pairwise alignment of genomic dna
Improved pairwise alignment of genomic dna
| Hi-index | 0.00 |
Most algorithms for reconstruction of evolutionary histories involving large-scale events such as duplications, deletions or rearrangements, work on sequences of predetermined markers, for example protein coding genes or other functional elements. However, markers defined in this way ignore information included in non-coding sequences, are prone to errors in annotation, and may even introduce artifacts due to partial gene copies or chimeric genes. We propose the problem of sequence segmentation where the goal is to automatically select suitable markers based on sequence homology alone. We design an algorithm for this problem which can tolerate certain amount of inaccuracies in the input alignments and still produce segmentation of the sequence to markers with high coverage and accuracy. We test our algorithm on several artificial and real data sets representing complex clusters of segmental duplications. Our software is available at http://compbio.fmph.uniba.sk/atomizer/