DocumentCode :
1617633
Title :
Multithreaded Multiple Sequence Alignments
Author :
Bai, Joanne ; Rezaei, Siamak
Author_Institution :
UNBC, Ottawa, Ont.
fYear :
2006
Firstpage :
2863
Lastpage :
2866
Abstract :
Based on the mixed idea of progressive alignment and divide-and-conquer alignment, two different multithreaded multiple sequence alignment programs, depending on how the guide tree(s) would be applied, are implemented for checking the improvements of alignment speed and sensitivity. The single-tree alignment builds a uniformed guide tree for the full-length sequences at the beginning, which will be used by all the sub-alignments as guide tree. In multiple-tree alignment, sequences will be firstly cut into pieces and these sub-sequences will build their own guide trees to guide their individual alignments. Multiple-tree alignment seems having a better speedup performance than the single tree alignment, but neither of them, at this stage, shows ideal sensitivity results as the number of threads increases. Therefore, some heuristic methods for fixing the cut points were suggested for future improvement, such as overlapping alignment and sliding window alignment
Keywords :
divide and conquer methods; heuristic programming; medical computing; trees (mathematics); divide-and-conquer alignment; heuristic methods; multiple-tree alignment; multithreaded multiple sequence alignments; progressive alignment; single-tree alignment; Biomedical engineering; Computer science; Error correction; Mathematical model; Multidimensional systems; Parallel programming; Protocols; Sequences; Windows; Yarn;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Engineering in Medicine and Biology Society, 2005. IEEE-EMBS 2005. 27th Annual International Conference of the
Conference_Location :
Shanghai
Print_ISBN :
0-7803-8741-4
Type :
conf
DOI :
10.1109/IEMBS.2005.1617071
Filename :
1617071
Link To Document :
بازگشت