<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/38752?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/38752?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37965/kobas-a-web-server-for-geneprotein-functional-annotation-and-functional-gene-set-enrichment</guid>
	<pubDate>Fri, 19 Oct 2018 09:36:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37965/kobas-a-web-server-for-geneprotein-functional-annotation-and-functional-gene-set-enrichment</link>
	<title><![CDATA[KOBAS: a web server for gene/protein functional annotation and functional gene set enrichment]]></title>
	<description><![CDATA[<p><span>KOBAS 3.0 is a web server for gene/protein functional annotation (</span><a href="http://kobas.cbi.pku.edu.cn/annotate.php">Annotate</a><span>&nbsp;module) and functional gene set enrichment(Enrichment module). For Annotate module, it accepts gene list as input, including IDs or sequences, and generates annotations for each gene based on multiple databases about pathways, diseases, and Gene Ontology. For Enrichment module, it can accept either gene list or gene expression data as input, and generates enriched gene sets, corresponding name, p-value or a probability of enrichment and enrichment score based on results of multiple methods.</span></p><p>Address of the bookmark: <a href="http://kobas.cbi.pku.edu.cn/" rel="nofollow">http://kobas.cbi.pku.edu.cn/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</guid>
	<pubDate>Wed, 22 Jun 2016 05:41:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</link>
	<title><![CDATA[NearHGT]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the transfer of genetic material between organisms, is crucial for genetic innovation and the evolution of genome architecture. Existing HGT detection algorithms rely on a strong phylogenetic signal distinguishing the transferred sequence from ancestral (vertically derived) genes in its recipient genome. Detecting HGT between closely related species or strains is challenging, as the phylogenetic signal is usually weak and the nucleotide composition is normally nearly identical. Nevertheless, there is a great importance in detecting HGT between congeneric species or strains, especially in clinical microbiology, where understanding the emergence of new virulent and drug-resistant strains is crucial, and often time-sensitive.</p>
<p>We developed a novel, self-contained technique named&nbsp;<em>Near HGT</em>, based on the&nbsp;<em>synteny index</em>, to measure the divergence of a gene from its native genomic environment and used it to identify candidate HGT events between closely related strains. The method confirms candidate transferred genes based on the&nbsp;<em>constant relative mutability</em>&nbsp;(CRM). Using CRM, the algorithm assigns a confidence score based on &ldquo;unusual&rdquo; sequence divergence. A gene exhibiting exceptional deviations according to both synteny and mutability criteria, is considered a validated HGT product. We first employed the technique to a set of three&nbsp;<em>E. coli</em>&nbsp;strains and detected several highly probable horizontally acquired genes. We then compared the method to existing HGT detection tools using a larger strain data set.</p>
<p>When combined with additional approaches our new algorithm provides richer picture and brings us closer to the goal of detecting all newly acquired genes in a particular strain.</p>
<p><strong>Availability:</strong><span>&nbsp;The method is publicly available at</span><a href="http://research.haifa.ac.il/~ssagi/software/nearHGT.zip">http://research.haifa.ac.il/~ssagi/software/nearHGT.zip</a></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41362/genemates-an-r-package-for-detecting-horizontal-gene-co-transfer-between-bacteria-using-gene-gene-associations-controlled-for-population-structure</guid>
	<pubDate>Sat, 07 Mar 2020 05:52:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41362/genemates-an-r-package-for-detecting-horizontal-gene-co-transfer-between-bacteria-using-gene-gene-associations-controlled-for-population-structure</link>
	<title><![CDATA[GeneMates: an R package for Detecting Horizontal Gene Co-transfer between Bacteria Using Gene-gene Associations Controlled for Population Structure]]></title>
	<description><![CDATA[<p><span>GeneMates is an R package implementing a network approach to identify horizontal gene co-transfer (HGcoT) between bacteria using whole-genome sequencing (WGS) data. It is particularly useful for investigating intra-species HGcoT, where presence-absence status of acquired genes is usually confounded by bacterial population structure due to clonal reproduction.</span></p>
<p><a href="https://www.biorxiv.org/content/10.1101/2020.02.29.970970v1">https://www.biorxiv.org/content/10.1101/2020.02.29.970970v1</a></p><p>Address of the bookmark: <a href="https://github.com/wanyuac/GeneMates" rel="nofollow">https://github.com/wanyuac/GeneMates</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35802/bioinformatics-tools-to-detect-horizontal-gene-transfer-hgt-in-genomes</guid>
	<pubDate>Fri, 02 Mar 2018 04:56:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35802/bioinformatics-tools-to-detect-horizontal-gene-transfer-hgt-in-genomes</link>
	<title><![CDATA[Bioinformatics tools to detect horizontal gene transfer (HGT) in genomes]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the &ldquo;non-sexual movement of genetic material between two organisms&rdquo; , is relatively common in prokaryotes&nbsp;and single-celled eukaryotes, but a number of factors combine to make it far rarer in multicellular eukaryotes. In order for a eukaryotic species to gain a gene by HGT, foreign DNA must enter the host nucleus, integrate into the genome, and in more complex organisms it must enter the sequestered germline in order to be transmitted to offspring. Once there, it must not experience strong negative selection, despite potential for genetic incompatibility with the host genome and mismatch between the niche of the donor and the host. Over the longer term, foreign DNA may become &ldquo;domesticated&rdquo; in the recipient genome and provide novel function.</p><p>Following are the popular tool to detect HGT in genomes:</p><p><a href="http://www.trex.uqam.ca/index.php?action=hgt&amp;project=trex">T-REX</a>&nbsp;/&nbsp;<a href="http://www.trex.uqam.ca/download/hgt-detection_3.22.zip">3.22</a></p><p>HGT detection /&nbsp;download &amp; compile</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/20525630">20525630</a></p><p>&nbsp;</p><p><a href="http://compbio.engr.uconn.edu/software/RANGER-DTL/">RANGER-DTL</a>&nbsp;/&nbsp;<a href="http://compbio.engr.uconn.edu/software/RANGER-DTL/Linux.zip">2.0</a></p><p>HGT detection /&nbsp;download binary</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/22689773">22689773</a></p><p>&nbsp;</p><p><a href="https://bioinfocs.rice.edu/phylonet">PhyloNet</a>&nbsp;/&nbsp;<a href="https://bioinfocs.rice.edu/sites/g/files/bxs266/f/kcfinder/files/PhyloNet_3.6.1.jar">3.6.1</a></p><p>HGT detection /&nbsp;download binary</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/18662388">18662388</a></p><p>&nbsp;</p><p><a href="https://www.cs.hmc.edu/~hadas/jane/index.html">Jane</a>&nbsp;/&nbsp;<a href="https://www.cs.hmc.edu/~hadas/jane/form.html">4.01</a></p><p>HGT detection /&nbsp;download binary (!license!)</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/20181081">20181081</a></p><p>&nbsp;</p><p><a href="http://www.tree-puzzle.de/">TREE-PUZZLE</a>&nbsp;/&nbsp;<a href="http://www.tree-puzzle.de/tree-puzzle-5.3.rc16-linux.tar.gz">5.3.rc16</a></p><p>HGT detection /&nbsp;download &amp; compile</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/11934758">11934758</a></p><p>&nbsp;</p><p><a href="http://www.sigmath.es.osaka-u.ac.jp/shimo-lab/prog/consel/">CONSEL</a>&nbsp;/&nbsp;<a href="http://www.sigmath.es.osaka-u.ac.jp/shimo-lab/prog/consel/pub/cnsls020.tgz">0.20</a></p><p>HGT detection /&nbsp;download</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/11751242">11751242</a></p><p>&nbsp;</p><p><a href="http://darkhorse.ucsd.edu/">DarkHorse</a>&nbsp;/&nbsp;<a href="http://darkhorse.ucsd.edu/DarkHorse-1.5_rev170.tar.gz">1.5 rev170</a></p><p>HGT detection /&nbsp;download &amp; install</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/17274820">17274820</a></p><p>&nbsp;</p><p><a href="https://github.com/DittmarLab/HGTector">HGTector</a>&nbsp;/&nbsp;<a href="https://github.com/DittmarLab/HGTector/archive/wgshgt.zip">0.2.1</a></p><p>HGT detection /&nbsp;git clone</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/25159222">25159222</a></p><p>&nbsp;</p><p><a href="http://www5.esu.edu/cpsc/bioinfo/software/EGID/">EGID</a>&nbsp;/&nbsp;<a href="http://www5.esu.edu/cpsc/bioinfo/software/EGID/EGID_1.0.tar.gz">1.0</a></p><p>HGT detection /&nbsp;download</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/22355228">22355228</a></p><p>&nbsp;</p><p><a href="http://exon.gatech.edu/GeneMark/">GeneMarkS</a>&nbsp;/&nbsp;<a href="http://exon.gatech.edu/GeneMark/license_download.cgi">4.30</a></p><p>HGT detection / download binary (!license!)</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/9461475">9461475</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</guid>
	<pubDate>Wed, 22 Jun 2016 05:37:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</link>
	<title><![CDATA[DarkHorse]]></title>
	<description><![CDATA[<p><em>DarkHorse</em>&nbsp;is a bioinformatic method for rapid, automated identification and ranking of phylogenetically atypical proteins on a genome-wide basis. It works by selecting potential ortholog matches from a reference database of amino acid sequences, then using these matches to calculate a lineage probability index (LPI) score for each genome protein.</p>
<p>LPI scores are inversely proportional to the phylogenetic distance between database match sequences and the query genome. These scores are useful not only for large-scale<em>de novo</em>&nbsp;predictions of horizontally transferred proteins, but can also serve as an independent quality control test for potential horizontal transfer candidates identified by alternative methods, especially those based on nucleic acid signatures. Candidates having high LPI scores are unlikely to have been horizontally transferred, since they are highly conserved among closely related organisms.</p>
<p>One unique and powerful feature of the DarkHorse HGT Candidate database is the opportunity to explore the phylogenetic background of potential HGT donors as well as recipients. The breadth of the database allows not only query sequences, but also their database match partners to be evaluated for sequence similarity or novelty compared to taxonomically related organisms.</p>
<p><em>DarkHorse</em>&nbsp;is configurable for varying degrees of phylogenetic granularity and protein sequence conservation. Users should consult the&nbsp;<a href="http://darkhorse.ucsd.edu/#references">references</a>&nbsp;cited below for a complete explanation of parameter selection and result interpretation. A brief&nbsp;<a href="http://darkhorse.ucsd.edu/tutorial.html">tutorial</a>&nbsp;page is also available on-line.</p><p>Address of the bookmark: <a href="http://darkhorse.ucsd.edu/download.html" rel="nofollow">http://darkhorse.ucsd.edu/download.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33219/dbcan-a-web-server-and-database-for-automated-carbohydrate-active-enzyme-annotation</guid>
	<pubDate>Mon, 29 May 2017 05:39:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33219/dbcan-a-web-server-and-database-for-automated-carbohydrate-active-enzyme-annotation</link>
	<title><![CDATA[dbCAN: a web server and DataBase for automated Carbohydrate-active enzyme ANnotation]]></title>
	<description><![CDATA[<p><a href="http://csbl.bmb.uga.edu/dbCAN/index.php">dbCAN</a>&nbsp;is a web server and&nbsp;<span style="text-decoration: underline;">D</span>ata<span style="text-decoration: underline;">B</span>ase for&nbsp;<a href="http://csbl.bmb.uga.edu/dbCAN/annotate.php"><strong>automated&nbsp;<span style="text-decoration: underline;">C</span>arbohydrate-active enzyme&nbsp;<span style="text-decoration: underline;">AN</span>notation</strong></a>, funded by the&nbsp;<a href="http://bioenergycenter.org/">BioEnergy Science Center of the DOE</a>. Similar resources on the web include&nbsp;<a href="http://www.cazy.org/" target="_blank">CAZy database</a>&nbsp;and&nbsp;<a href="http://cricket.ornl.gov/cgi-bin/cat.cgi" target="_blank">CAT</a>. All data in dbCAN are generated based on the family classification from&nbsp;<a href="http://www.cazy.org/" target="_blank">CAZy database</a>&nbsp;while it has the following&nbsp;<strong><span style="text-decoration: underline;">unique features</span></strong>&nbsp;compared with CAZy database and CAT:</p>
<ul>
<li>dbCAN provides the capability of&nbsp;<a href="http://csbl.bmb.uga.edu/dbCAN/annotate.php">automated and comprehensive CAZyme annotation</a>&nbsp;of a given genome submitted by the user;</li>
<li>dbCAN provides an explicitly defined&nbsp;<span style="text-decoration: underline;">signature domain</span>&nbsp;for each and every CAZyme family along with its location in all the relevant full-length CAZyme proteins in all sequenced&nbsp;<a href="http://csbl.bmb.uga.edu/dbCAN/genome.php">genomes</a>;</li>
<li>dbCAN provides the most complete set of&nbsp;<span style="text-decoration: underline;">metagenomic CAZyme</span>&nbsp;genes published so far and represents the first step towards discovering novel CAZyme catalysts in metagenomes;</li>
<li>dbCAN provides a&nbsp;<span style="text-decoration: underline;">subfamily classification</span>&nbsp;of the existing CAZyme families based on sequence similarities;</li>
<li>dbCAN make all pre-computed data freely available to the public, including sequence alignments,&nbsp;<a href="http://csbl.bmb.uga.edu/dbCAN/download/">hidden markov models (HMMs)</a>&nbsp;and phylogenies of the signature domain regions in each and every CAZyme family and subfamily.</li>
</ul>
<p><a href="http://csbl.bmb.uga.edu/dbCAN/help.php">dbCAN</a>&nbsp;is updated regularly when&nbsp;<a href="http://www.cazy.org/" target="_blank">CAZy database</a>&nbsp;created new families based on latest literature.</p><p>Address of the bookmark: <a href="http://csbl.bmb.uga.edu/dbCAN/index.php" rel="nofollow">http://csbl.bmb.uga.edu/dbCAN/index.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38487/betsy-a-new-backward-chaining-expert-system-for-automated-development-of-pipelines-in-bioinformatics</guid>
	<pubDate>Mon, 17 Dec 2018 18:46:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38487/betsy-a-new-backward-chaining-expert-system-for-automated-development-of-pipelines-in-bioinformatics</link>
	<title><![CDATA[BETSY: A new backward-chaining expert system for automated development of pipelines in Bioinformatics]]></title>
	<description><![CDATA[<p>The BETSY provides a command-line interface and available at&nbsp;<a href="https://github.com/jefftc/changlab">https://github.com/jefftc/changlab</a>. A user first searches in the knowledge base for desired output and then BETSY develops an initial workflow to produce that data which is later examined by the user. The user can optimize the parameters, the algorithm to preprocess the data, and normalize it depending on the task.</p>
<p>Currently, BETSY consists of modules required for the microarray and next-generation sequencing data [4] such as expression analysis, classification, peak calling, and visualization.</p><p>Address of the bookmark: <a href="https://github.com/jefftc/changlab" rel="nofollow">https://github.com/jefftc/changlab</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44483/baclife-an-automated-genome-mining-tool-for-identification-of-lifestyle-associated-genes</guid>
	<pubDate>Fri, 15 Mar 2024 04:59:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44483/baclife-an-automated-genome-mining-tool-for-identification-of-lifestyle-associated-genes</link>
	<title><![CDATA[bacLIFE: an automated genome mining tool for identification of lifestyle associated genes]]></title>
	<description><![CDATA[<p style="margin-top: 0px; margin-bottom: 16px; color: #1f2328; font-size: 16px; font-style: normal; font-weight: 400; text-align: start; background-color: #ffffff;" dir="auto">bacLIFE is a streamlined computational workflow that annotates bacterial genomes and performs large-scale comparative genomics to predict bacterial lifestyles and to pinpoint candidate genes, denominated<span>&nbsp;</span><strong style="font-weight: var(--base-text-weight-semibold, 600);">lifestyle-associated genes (LAGs)</strong>, and biosynthetic gene clusters associated with each lifestyle detected. This whole process is divided into different modules:</p>
<ul style="margin-top: 0px; margin-bottom: 16px; color: #1f2328; font-size: 16px; font-style: normal; font-weight: 400; text-align: start; background-color: #ffffff;" dir="auto">
<li><strong style="font-weight: var(--base-text-weight-semibold, 600);">Clustering module</strong><span>&nbsp;</span>Predicts, clusters and annotates the genes of every input genome</li>
<li style="margin-top: 0.25em;"><strong style="font-weight: var(--base-text-weight-semibold, 600);">Lifestyle prediction</strong><span>&nbsp;</span>Employs a machine learning model to forecast bacterial lifestyle or other specified metadata</li>
<li style="margin-top: 0.25em;"><strong style="font-weight: var(--base-text-weight-semibold, 600);">Analitical module (Shiny app)</strong><span>&nbsp;</span>Results from the previous modules are embedded in a user-friendly interface for comprehensive and interactive comparative genomics.</li>
</ul>
<p style="margin-top: 0px; margin-bottom: 16px; color: #1f2328; font-size: 16px; font-style: normal; font-weight: 400; text-align: start; background-color: #ffffff;" dir="auto">You can find the complete wiki here [<a href="https://github.com/Carrion-lab/bacLIFE/wiki/bacLIFE-wiki">https://github.com/Carrion-lab/bacLIFE/wiki/bacLIFE-wiki</a>]</p><p>Address of the bookmark: <a href="https://github.com/Carrion-lab/bacLIFE" rel="nofollow">https://github.com/Carrion-lab/bacLIFE</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14191/scalpel</guid>
	<pubDate>Wed, 20 Aug 2014 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14191/scalpel</link>
	<title><![CDATA[Scalpel]]></title>
	<description><![CDATA[<p>A team from Cold Spring Harbor Laboratory has released an algorithm, called Scalpel, for finding insertions and deletions in next generation sequencing data sets. Scalpel, which is open source and <a href="http://scalpel.sourceforge.net/" title="available for download">available for download</a> on SourceForge,&nbsp;<span>outperformed the popular tools GATK HaplotypeCaller and SOAPindel in test runs on both simulated and real whole human exomes.</span></p><p>Like other indel callers, Scalpel works by performing <em>de novo</em>&nbsp;assembly of regions of interest, so that misalignment to the reference genome cannot obscure the presence of an insertion or deletion. Scalpel's innovation is to repeatedly check its assembly before comparing to the reference genome, to account for simple sequence repeats that are a regular source of error in indel calling. When Scalpel assembles an exon, it collects reads that map to that exon (including partial matches), splits them into k-mers, and creates a de Bruijn graph to span the exon; however, if it detects repeats in the map, it iteratively increases the size of the k-mers by one base until the repeats are eliminated. This ensures that the final assembly of the exon is highly accurate while minimizing compute time.</p><p>The Cold Spring Harbor team's validation of Scalpel, <a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3069.html" title="published over the weekend in Nature Methods">published over the weekend in <em>Nature Methods</em></a>, compares Scalpel's performance on a live whole exome against HaplotypeCaller and SOAPindel. The donor is an individual with serious neurological disorders, which may be linked to a high incidence of indels. One thousand indels from this individual's exome, called by one or more of the informatics pipelines, were selected for focused resequencing. This resequencing revealed a 77% true positive rate for Scalpel calls, dramatically better than the rates for either of the competing tools; Scalpel performed especially well with indels longer than five base pairs, a traditional weak point for indel callers.</p><p>Finally, the authors demonstrate Scalpel's use on a large set of genetic data from nearly 600 families who donated samples to the Simons Simplex Collection, a project of the Simons Foundation Autism Research Initiative. Scalpel found a very high enrichment for indels in children affected by autism, compared with their unaffected siblings, a pattern that persisted even after excluding common variants.</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35559/computational-resources-for-te-discovery-and-te-detection</guid>
	<pubDate>Mon, 12 Feb 2018 10:29:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35559/computational-resources-for-te-discovery-and-te-detection</link>
	<title><![CDATA[Computational resources for TE discovery and TE detection]]></title>
	<description><![CDATA[<p><span>Transposable Elements (TEs) to genome structure and evolution as well as their impact on genome sequencing, assembly, annotation and alignment has generated increasing interest in developing new methods for their computational analysis. </span></p><p><span>Following are the list of r</span><span>esource and location for TE discovery and TE detection:</span></p><p>BLASTER suite&nbsp;http://urgi.versailles.inra.fr/development/blaster/&nbsp;</p><p>Censor&nbsp;http://www.girinst.org/censor/download.php&nbsp;</p><p>find_ltr&nbsp;http://darwin.informatics.indiana.edu/cgi-bin/evolution/ltr.pl&nbsp;</p><p>FINDMITE http://jaketu.biochem.vt.edu/dl_software.htm </p><p>HMMER http://hmmer.janelia.org/ </p><p>LTR_FINDER http://tlife.fudan.edu.cn/ltr_finder/ </p><p>LTR_STRUC http://www.genetics.uga.edu/retrolab/data/LTR_Struc.html </p><p>LTR_MINER http://genomebiology.com/2004/5/10/R79/suppl/s7 </p><p>LTR_par http://www.eecs.wsu.edu/~ananth/software.htm </p><p>MAK http://wesslercluster.plantbio.uga.edu/mak06.html </p><p>MaskerAid http://blast.wustl.edu/maskeraid/ </p><p>mer-engine http://mer-engine.cshl.edu/mer-home.php </p><p>mreps http://bioinfo.lifl.fr/mreps/ </p><p>PILER http://www.drive5.com/piler/ </p><p>PLOTREP http://repeats.abc.hu/cgi-bin/plotrep.pl </p><p>RepBase http://www.girinst.org/ </p><p>RepeatFinder http://cbcb.umd.edu/software/RepeatFinder/ </p><p>RepeatGluer http://nbcr.sdsc.edu/euler/intro_tmp.htm </p><p>RepeatMasker http://www.repeatmasker.org/ </p><p>RepeatRunner http://www.yandell-lab.org/repeat_runner/index.html </p><p>RepeatScout http://repeatscout.bioprojects.org/ </p><p>repeat-match http://mummer.sourceforge.net/ </p><p>REPuter http://www.genomes.de/ </p><p>RetroMap http://www.burchsite.com/bioi/RetroMapHome.html </p><p>SMaRTFinder http://bioinf.dimi.uniud.it/software/software/smartfinder </p><p>Tandem Repeats Finder http://tandem.bu.edu/trf/trf.html </p><p>Transposon Cluster Finder http://www.mssm.edu/labs/warbup01/paper/files.html </p><p>TE nest http://www.plantgdb.org/prj/TE_nest/TE_nest.html </p><p>TRANSPO http://alggen.lsi.upc.es/recerca/search/transpo/transpo.html </p><p>TSDfinder http://www.ncbi.nlm.nih.gov/CBBresearch/Landsman/TSDfinder/ </p><p>Tu Lab TE tools http://jaketu.biochem.vt.edu/dl_software.htm </p><p>WU-BLAST http://blast.wustl.edu</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>