Transposon identification using profile HMMs

DSpace/Manakin Repository

Transposon identification using profile HMMs

Citable link to this page


Title: Transposon identification using profile HMMs
Author: Edlefsen, Paul T; Liu, Jun

Note: Order does not necessarily reflect citation order of authors.

Citation: Edlefsen, Paul T, and Jun S Liu. 2010. “Transposon Identification Using Profile HMMs.” BMC Genomics 11 (Suppl 1): S10. doi:10.1186/1471-2164-11-s1-s10.
Full Text & Related Files:
Abstract: Background

Transposons are "jumping genes" that account for large quantities of repetitive content in genomes. They are known to affect transcriptional regulation in several different ways, and are implicated in many human diseases. Transposons are related to microRNAs and viruses, and many genes, pseudogenes, and gene promoters are derived from transposons or have origins in transposon-induced duplication. Modeling transposon-derived genomic content is difficult because they are poorly conserved. Profile hidden Markov models (profile HMMs), widely used for protein sequence family modeling, are rarely used for modeling DNA sequence families. The algorithm commonly used to estimate the parameters of profile HMMs, Baum-Welch, is prone to prematurely converge to local optima. The DNA domain is especially problematic for the Baum-Welch algorithm, since it has only four letters as opposed to the twenty residues of the amino acid alphabet.


We demonstrate with a simulation study and with an application to modeling the MIR family of transposons that two recently introduced methods, Conditional Baum-Welch and Dynamic Model Surgery, achieve better estimates of the parameters of profile HMMs across a range of conditions.


We argue that these new algorithms expand the range of potential applications of profile HMMs to many important DNA sequence family modeling problems, including that of searching for and modeling the virus-like transposons that are found in all known genomes.
Published Version: doi:10.1186/1471-2164-11-S1-S10
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at
Citable link to this page:
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search