CISUC - Experiments with bicriteria sequence alignment
CISUC

Experiments with bicriteria sequence alignment

Authors

Abstract

In this article we investigate the performance of a multicriteria dynamic programming algorithm for pairwise global sequence alignment that maximizes the number of matches and minimizes the number of indels or gaps.We provide estimates on the number of optimal alignments for pairs of random sequences, as well as computational results in a benchmark dataset. Our empirical analysis indicates that this approach is feasible from practical point of view.

Cited by

Year 2013 : 1 citations

 K DeRonne, G Karypis, Pareto Optimal Pairwise Sequence Alignment, IEEE Computational Biology and Bionformatics, Issue: 99, 2013

Year 2012 : 1 citations

 T. Schnattinger, U. Schöning, H. A. Kestler. Pareto-optimal RNA sequence-structure alignments. 9th International Workshop on Computational Systems Biology, WSCB 2012.

Year 2010 : 2 citations

 Akito Taneda, Multi-objective pairwise RNA sequence alignment, Bioinformatics, 2010 (doi:10.1093/bioinformatics/btq439)

 A Taneda, Multi-objective pairwise RNA sequence alignment, Bioinformatics, 2010