TY - JOUR
T1 - HMMerge
T2 - An ensemble method for multiple sequence alignment
AU - Park, Minhyuk
AU - Warnow, Tandy
N1 - Publisher Copyright:
© 2023 The Author(s). Published by Oxford University Press.
PY - 2023
Y1 - 2023
N2 - Motivation: Despite advances in method development for multiple sequence alignment over the last several decades, the alignment of datasets exhibiting substantial sequence length heterogeneity, especially when the input sequences include very short sequences (either as a result of sequencing technologies or of large deletions during evolution) remains an inadequately solved problem. Results: We present HMMerge, a method to compute an alignment of datasets exhibiting high sequence length heterogeneity, or to add short sequences into a given 'backbone' alignment. HMMerge builds on the technique from its predecessor alignment methods, UPP and WITCH, which build an ensemble of profile HMMs to represent the backbone alignment and add the remaining sequences into the backbone alignment using the ensemble. HMMerge differs from UPP and WITCH by building a new 'merged' HMM from the ensemble, and then using that merged HMM to align the query sequences. We show that HMMerge is competitive with WITCH, with an advantage over WITCH when adding very short sequences into backbone alignments.
AB - Motivation: Despite advances in method development for multiple sequence alignment over the last several decades, the alignment of datasets exhibiting substantial sequence length heterogeneity, especially when the input sequences include very short sequences (either as a result of sequencing technologies or of large deletions during evolution) remains an inadequately solved problem. Results: We present HMMerge, a method to compute an alignment of datasets exhibiting high sequence length heterogeneity, or to add short sequences into a given 'backbone' alignment. HMMerge builds on the technique from its predecessor alignment methods, UPP and WITCH, which build an ensemble of profile HMMs to represent the backbone alignment and add the remaining sequences into the backbone alignment using the ensemble. HMMerge differs from UPP and WITCH by building a new 'merged' HMM from the ensemble, and then using that merged HMM to align the query sequences. We show that HMMerge is competitive with WITCH, with an advantage over WITCH when adding very short sequences into backbone alignments.
UR - http://www.scopus.com/inward/record.url?scp=85161079997&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85161079997&partnerID=8YFLogxK
U2 - 10.1093/bioadv/vbad052
DO - 10.1093/bioadv/vbad052
M3 - Article
C2 - 37128578
AN - SCOPUS:85161079997
SN - 2635-0041
VL - 3
JO - Bioinformatics Advances
JF - Bioinformatics Advances
IS - 1
M1 - vbad052
ER -