Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
New Distances for Improving Progressive Alignment Algorithm
verfasst von : Ahmed Mokaddem, Mourad Elloumi
Erschienen in: Advances in Computing and Information Technology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Distance computation between sequences is an important method to compare between biological sequences. In fact, we attribute a value to the sequences in order to estimate a percentage of similarity that can help to extract structural or functional information. Distance computation is also more important in the progressive multiple alignment algorithm. Indeed, it can influence the branching order of the sequences alignment and then the final multiple alignment. In this paper, we present new methods for distance computation in order to improve the progressive multiple alignment approach. The main difference between our distances and the other existed methods consists in the use of all the sequences of the set in the pair-wise comparison. We tested our distances on BALIBASE benchmarks and we compared with other typical distances. We obtained very good results.