<?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/44898?</link>
	<atom:link href="https://bioinformaticsonline.com/related/44898?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39380/mgert-mobile-genetic-elements-retrieving-tool</guid>
	<pubDate>Sat, 18 May 2019 08:58:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39380/mgert-mobile-genetic-elements-retrieving-tool</link>
	<title><![CDATA[MGERT: Mobile Genetic Elements Retrieving Tool]]></title>
	<description><![CDATA[<p><em>MGERT</em><span>&nbsp;is a computational pipeline for easy retrieving of MGE's coding sequences of a particular family from genome assemblies.&nbsp;</span><em>MGERT</em><span>&nbsp;utilizes several established bioinformatic tools combined into single pipeline which hides different technical quirks from an inexperienced user.</span></p><p>Address of the bookmark: <a href="https://github.com/andrewgull/MGERT" rel="nofollow">https://github.com/andrewgull/MGERT</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42923/flanker</guid>
	<pubDate>Sat, 27 Feb 2021 22:04:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42923/flanker</link>
	<title><![CDATA[Flanker]]></title>
	<description><![CDATA[<p><span>Flanker, a Python package which performs alignment-free clustering of gene flanking sequences in a consistent format, allowing investigation of&nbsp;<span>mobile genetic elements (</span>MGEs) without prior knowledge of their structure.&nbsp;<span>Flanker can be flexibly parameterised to finetune outputs by characterising upstream and downstream regions separately and investigating variable lengths of flanking sequence.</span></span></p>
<p><span><img src="https://github.com/wtmatlock/flanker/raw/main/docs/frontpage.png" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/wtmatlock/flanker" rel="nofollow">https://github.com/wtmatlock/flanker</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</guid>
	<pubDate>Sat, 02 Dec 2017 18:25:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: de-novo assembly &amp; annotation Pipeline for Transposable Elements]]></title>
	<description><![CDATA[<p>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</p>
<ul>
<li>
<p>dnaPipeTE is developped by Cl&eacute;ment Goubert, Laurent Modolo and the TREEP team of the LBBE:&nbsp;<a href="http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en">http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en</a></p>
</li>
<li>
<p>You can find the original publication in GBE here:&nbsp;<a href="https://academic.oup.com/gbe/article/7/4/1192/533768">https://academic.oup.com/gbe/article/7/4/1192/533768</a></p>
</li>
</ul>
<p><a href="https://github.com/clemgoub/dnaPipeTE/blob/dev/dnaPipefront.png" target="_blank"><img src="https://github.com/clemgoub/dnaPipeTE/raw/dev/dnaPipefront.png" alt="Front" style="border: 0px;"></a><em>output examples of quantification and TE landscape (relative age) produced by dnaPipeTE</em></p>
<p><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</guid>
	<pubDate>Tue, 13 Aug 2024 07:16:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</link>
	<title><![CDATA[HELIANO: A fast and accurate tool for detection of Helitron-like elements]]></title>
	<description><![CDATA[<p><span>Helitron-like elements (HLE1 and HLE2) are DNA transposons. They have been found in diverse species and seem to play significant roles in the evolution of host genomes. Although known for over twenty years, Helitron sequences are still challenging to identify. Here, we propose HELIANO (Helitron-like elements annotator) as an efficient solution for detecting Helitron-like elements.</span></p>
<p>https://academic.oup.com/nar/advance-article/doi/10.1093/nar/gkae679/7730539?login=true</p><p>Address of the bookmark: <a href="https://github.com/Zhenlisme/heliano/" rel="nofollow">https://github.com/Zhenlisme/heliano/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/38257/bioinformatics-programme-officer-international-centre-for-genetic-icgeb-engineering-and-biotechnology</guid>
  <pubDate>Fri, 23 Nov 2018 03:50:16 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Programme Officer @ International Centre for Genetic ICGEB Engineering and Biotechnology]]></title>
  <description><![CDATA[
<p>The following vacancies are available in the DBT Apex Biotechnology Information project at ICGEB, New Delhi, India. These positions are available for a period of approx. two years, however, initial appointment offer will be for 6 months, which will be extended based on performance of work. Salaries will be offered as per DBT, educational qualification and experience. Depending on requirements, selected candidates may be required to work on location from the Department of Biotechnology, New Delhi. Shortlisted candidates will be invited for an interview at ICGEB. Only the selected candidates will be informed individually. No TA/DA or accommodation will be offered to the candidates attending the interview. </p>

<p>4 Programme Officer 1 <br />5 Technical Research Assistant 1 </p>

<p>Minimum Educational Qualification, desirable experience and expected duties: </p>

<p>4: The applicants should be Postgraduates with experience in Data collection and Statistics, especially in Biotechnology-related data. </p>

<p>Expected duties: Collection of Biotechnology related information from India, to facilitate the Apex BTIC experts committee review of programmes at centres and R&amp;D programs funded by DBT. </p>

<p>5: The applicants should be Postgraduates in Science with experience in Bioinformatics-related projects. <br />Expected duties: The candidates will assist the senior staff of the centre in daily activities and help in the preparation of the Annual Training Calendar, seminar and training podcasts/videos, repository of training material and Apex BTIC Newsletter. </p>

<p>Interested candidates should submit their full, updated Curriculum Vitae with a detailed description of relevant experience, along with two references by December 14th, 2018, addressed to, The Chairperson, DBT- Apex BTIC, ICGEB, Aruna Asaf Ali Marg, New Delhi 110067, Email: abtic@icgeb.res.in, kindly write “Application for DBT Apex BTIC vacancy” in the subject of the email or envelope, if sending by post.</p>

<p>Advertisement: http://www.icgeb.org/tl_files/Vacancies/dbt-abtic-vac-annmntrevsk.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43683/genview-a-phylogeny-based-comparative-genomics-software-to-analyze-the-genetic-environment-of-genes</guid>
	<pubDate>Tue, 28 Dec 2021 01:49:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43683/genview-a-phylogeny-based-comparative-genomics-software-to-analyze-the-genetic-environment-of-genes</link>
	<title><![CDATA[GEnView: A phylogeny based comparative genomics software to analyze the genetic environment of genes]]></title>
	<description><![CDATA[<p><span>A phylogeny based comparative genomics software to analyze the genetic environment of genes. The user can select one or several taxa and provide one or several reference protein(s). Genomes and plasmids (based on user choice) will be downloaded from the NCBI Assembly/NR database and searched for the respective gene. Alternatively, custom genomes can be provided. User selected stretches (20kbp by default) of the genes genetic environment are extracted, annotated and aligned between all genomes. The sequences are then visualized, enabling comparison of synteny and gene content.</span></p>
<p><span>More at&nbsp;https://pubmed.ncbi.nlm.nih.gov/34951622/</span></p><p>Address of the bookmark: <a href="https://github.com/EbmeyerSt/GEnView" rel="nofollow">https://github.com/EbmeyerSt/GEnView</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43445/parebrick-parallel-rearrangements-and-breaks-identification-toolkit</guid>
	<pubDate>Fri, 08 Oct 2021 10:20:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43445/parebrick-parallel-rearrangements-and-breaks-identification-toolkit</link>
	<title><![CDATA[PaReBrick: PArallel REarrangements and BReaks identification toolkit]]></title>
	<description><![CDATA[<p><span>PaReBrick. The tool takes a collection of strains represented as a sequence of oriented synteny blocks and a phylogenetic tree as input data. It identifies rearrangements, tests them for consistency with a tree, and sorts the events by their parallelism score. The tool provides diagrams of the neighbors for each block of interest, allowing the detection of horizontally transferred blocks or their extra copies and the inversions in which copied blocks are involved.We demonstrated PaReBrick&rsquo;s efficiency and accuracy and showed its potential to detect genome rearrangements responsible for pathogenicity and adaptation in bacterial genomes</span></p>
<p>More at&nbsp;https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btab691/6380551</p>
<p><img src="https://github.com/ctlab/parallel-rearrangements/raw/master/figs/pipeline.svg" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/ctlab/parallel-rearrangements" rel="nofollow">https://github.com/ctlab/parallel-rearrangements</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>