<?xml version="1.0" encoding="UTF-8" ?>
<oai_dc:dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>On the Search for Retrotransposons: Alternative Protocols to Obtain Sequences to Learn Profile Hidden Markov Models</dc:title>
<dc:creator>Fischer, Carlos N.</dc:creator>
<dc:creator>Campos, Victor De A.</dc:creator>
<dc:creator>Barella, Victor H.</dc:creator>
<dc:contributor>Universidade Estadual Paulista (UNESP)</dc:contributor>
<dc:subject>profile hidden Markov models</dc:subject>
<dc:subject>retrotransposons</dc:subject>
<dc:subject>transposable elements.</dc:subject>
<dc:description>Profile hidden Markov models (pHMMs) have been used to search for transposable elements (TEs) in genomes. For the learning of pHMMs aimed to search for TEs of the retrotransposon class, the conventional protocol is to use the whole internal nucleotide portions of these elements as representative sequences. To further explore the potential of pHMMs in such a search, we propose five alternative ways to obtain the sets of representative sequences of TEs other than the conventional protocol. In this study, we are interested in Bel-PAO, Copia, Gypsy, and DIRS superfamilies from the retrotransposon class. We compared the pHMMs of all six protocols. The test results show that, for each TE superfamily, the pHMMs of at least two of the proposed protocols performed better than the conventional one and that the number of correct predictions provided by the latter can be improved by considering together the results of one or more of the alternative protocols.</dc:description>
<dc:date>2018-12-11T17:20:08Z</dc:date>
<dc:date>2018-12-11T17:20:08Z</dc:date>
<dc:date>2018-05-01</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:identifier>http://dx.doi.org/10.1089/cmb.2017.0219</dc:identifier>
<dc:identifier>Journal of Computational Biology, v. 25, n. 5, p. 517-527, 2018.</dc:identifier>
<dc:identifier>1066-5277</dc:identifier>
<dc:identifier>http://hdl.handle.net/11449/176325</dc:identifier>
<dc:identifier>10.1089/cmb.2017.0219</dc:identifier>
<dc:identifier>2-s2.0-85046884932</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>Journal of Computational Biology</dc:relation>
<dc:relation>0,824</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:format>517-527</dc:format>
<dc:source>reponame:Repositório Institucional da UNESP</dc:source>
<dc:source>instname:Universidade Estadual Paulista (UNESP)</dc:source>
<dc:source>instacron:UNESP</dc:source>
<about>
<provenance>
<originDescription altered="" harvestDate="">
<datestamp>2021-10-23T17:16:52Z</datestamp>
<metadataNamespace>http://www.openarchives.org/OAI/2.0/oai_dc/</metadataNamespace>
<repositoryName>Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)</repositoryName>
</originDescription>
</provenance>
</about>
</oai_dc:dc>
<?xml version="1.0" encoding="UTF-8" ?>
<metadata schemaLocation="http://www.lyncode.com/xoai http://www.lyncode.com/xsd/xoai.xsd">
<element name="dc">
<element name="title">
<element name="none">
<field name="value">On the Search for Retrotransposons: Alternative Protocols to Obtain Sequences to Learn Profile Hidden Markov Models</field>
</element>
</element>
<element name="subject">
<element name="por">
<field name="value">profile hidden Markov models</field>
<field name="value">retrotransposons</field>
<field name="value">transposable elements.</field>
</element>
</element>
<element name="description">
<element name="none">
<field name="value">Profile hidden Markov models (pHMMs) have been used to search for transposable elements (TEs) in genomes. For the learning of pHMMs aimed to search for TEs of the retrotransposon class, the conventional protocol is to use the whole internal nucleotide portions of these elements as representative sequences. To further explore the potential of pHMMs in such a search, we propose five alternative ways to obtain the sets of representative sequences of TEs other than the conventional protocol. In this study, we are interested in Bel-PAO, Copia, Gypsy, and DIRS superfamilies from the retrotransposon class. We compared the pHMMs of all six protocols. The test results show that, for each TE superfamily, the pHMMs of at least two of the proposed protocols performed better than the conventional one and that the number of correct predictions provided by the latter can be improved by considering together the results of one or more of the alternative protocols.</field>
</element>
</element>
<element name="contributor">
<element name="none">
<field name="value">Universidade Estadual Paulista (UNESP)</field>
</element>
</element>
<element name="date">
<element name="none">
<field name="value">2018-12-11T17:20:08Z</field>
<field name="value">2018-12-11T17:20:08Z</field>
<field name="value">2018-05-01</field>
</element>
</element>
<element name="type">
<element name="driver">
<field name="value">info:eu-repo/semantics/article</field>
</element>
<element name="status">
<field name="value">info:eu-repo/semantics/publishedVersion</field>
</element>
</element>
<element name="format">
<element name="none">
<field name="value">517-527</field>
</element>
</element>
<element name="identifier">
<element name="uri">
<field name="value">http://dx.doi.org/10.1089/cmb.2017.0219</field>
<field name="value">Journal of Computational Biology, v. 25, n. 5, p. 517-527, 2018.</field>
<field name="value">1066-5277</field>
<field name="value">http://hdl.handle.net/11449/176325</field>
<field name="value">10.1089/cmb.2017.0219</field>
<field name="value">2-s2.0-85046884932</field>
</element>
</element>
<element name="language">
<element name="iso">
<field name="value">eng</field>
</element>
</element>
<element name="relation">
<element name="none">
<field name="value">Journal of Computational Biology</field>
<field name="value">0,824</field>
</element>
</element>
<element name="rights">
<element name="driver">
<field name="value">info:eu-repo/semantics/openAccess</field>
</element>
</element>
<element name="source">
<element name="none">
<field name="value">reponame:Repositório Institucional da UNESP</field>
<field name="value">instname:Universidade Estadual Paulista (UNESP)</field>
<field name="value">instacron:UNESP</field>
</element>
</element>
<element name="creator">
<element name="author">
<field name="value">Fischer, Carlos N.</field>
<field name="value">Campos, Victor De A.</field>
<field name="value">Barella, Victor H.</field>
</element>
</element>
</element>
<element name="others">
<field name="lastModifyDate">2021-10-23T17:16:52Z</field>
</element>
<element name="repository">
<field name="repositoryType">Repositório Institucional</field>
<field name="institutionType">PUB</field>
</element>
</metadata>