Skip to main navigation Skip to search Skip to main content

A beam-through algorithm to compute multiple sequence alignment

  • Zhanmao Cao
  • , Hong Shen
  • , Leiguang Gong
  • Shantou University
  • Japan Advanced Institute of Science and Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2005 International Conference on Machine Learning and Cybernetics, ICMLC 2005
PublisherIEEE Computer Society
Pages5704-5712
Number of pages9
ISBN (Electronic)0780390911
ISBN (Print)078039092X, 9780780390928
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventInternational Conference on Machine Learning and Cybernetics, ICMLC 2005 - Guangzhou, China
Duration: 18 Aug 200521 Aug 2005

Publication series

Name2005 International Conference on Machine Learning and Cybernetics, ICMLC 2005
Volume9

Conference

ConferenceInternational Conference on Machine Learning and Cybernetics, ICMLC 2005
Country/TerritoryChina
CityGuangzhou
Period18/08/0521/08/05

Keywords

  • Beam source
  • Beam-Through algorithm
  • Divide and conquer
  • Multiple sequence alignment

Fingerprint

Dive into the research topics of 'A beam-through algorithm to compute multiple sequence alignment'. Together they form a unique fingerprint.

Cite this