TY - GEN
T1 - A beam-through algorithm to compute multiple sequence alignment
AU - Cao, Zhanmao
AU - Shen, Hong
AU - Gong, Leiguang
PY - 2005
Y1 - 2005
N2 - This paper discusses a new approach Beam-Through Alignment (BTA) to multiple sequence alignment. With the beam sources given by using pairwise alignment, BTA detects the possible channel for specific beam source, and arrange most similar segments in common columns to form a beam for the current beam source. Then use already found beams as cut points to divide sequences to several parts for further alignment recursively. By split the least beam passed sequence step by step, BTA constructs a phylogenetic tree.
AB - This paper discusses a new approach Beam-Through Alignment (BTA) to multiple sequence alignment. With the beam sources given by using pairwise alignment, BTA detects the possible channel for specific beam source, and arrange most similar segments in common columns to form a beam for the current beam source. Then use already found beams as cut points to divide sequences to several parts for further alignment recursively. By split the least beam passed sequence step by step, BTA constructs a phylogenetic tree.
KW - Beam source
KW - Beam-Through algorithm
KW - Divide and conquer
KW - Multiple sequence alignment
UR - https://www.scopus.com/pages/publications/28444432313
M3 - Conference contribution
AN - SCOPUS:28444432313
SN - 078039092X
SN - 9780780390928
T3 - 2005 International Conference on Machine Learning and Cybernetics, ICMLC 2005
SP - 5704
EP - 5712
BT - 2005 International Conference on Machine Learning and Cybernetics, ICMLC 2005
T2 - International Conference on Machine Learning and Cybernetics, ICMLC 2005
Y2 - 18 August 2005 through 21 August 2005
ER -