<?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/2518?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/2518?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/37987/ropebwt2-incremental-construction-of-fm-index-for-dna-sequences</guid>
	<pubDate>Thu, 25 Oct 2018 04:48:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37987/ropebwt2-incremental-construction-of-fm-index-for-dna-sequences</link>
	<title><![CDATA[RopeBWT2: Incremental construction of FM-index for DNA sequences]]></title>
	<description><![CDATA[<p><span>RopeBWT2 is an tool for constructing the FM-index for a collection of DNA sequences. It works by incrementally inserting one or multiple sequences into an existing pseudo-BWT position by position, starting from the end of the sequences. This algorithm can be largely considered a mixture of&nbsp;</span><a href="http://dx.doi.org/10.1007/978-3-642-21458-5_20">BCR</a><span>&nbsp;and&nbsp;</span><a href="http://dfmi.sourceforge.net/">dynamic FM-index</a><span>. Nonetheless, ropeBWT2 is unique in that it may&nbsp;</span><em>implicitly</em><span>sort the input into reverse lexicographical order (RLO) or reverse-complement lexicographical order (RCLO) while building the index.</span></p><p>Address of the bookmark: <a href="https://github.com/lh3/ropebwt2" rel="nofollow">https://github.com/lh3/ropebwt2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/42023/encode3-a-collection-of-research-articles-and-related-content-describing-the-encyclopedia-of-dna-elements-its-datasets-and-tools</guid>
	<pubDate>Sat, 08 Aug 2020 08:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42023/encode3-a-collection-of-research-articles-and-related-content-describing-the-encyclopedia-of-dna-elements-its-datasets-and-tools</link>
	<title><![CDATA[ENCODE3: A collection of research articles and related content describing the Encyclopedia of DNA Elements, its datasets and tools.]]></title>
	<description><![CDATA[<p>How cells, tissues and organisms interpret the information encoded in the genome has vital implications for our understanding of development, health and disease. Launched in 2003, the ENCyclopedia Of DNA Elements (ENCODE) project has the aim of mapping the functional elements in the human genome (later expanded to include model organisms).</p><p>During the first phase of ENCODE, published in 2007, microarray-based technologies were used to detect regions associated with transcription factors, certain histone modifications and open chromatin within a pre-specified 1% of the human genome.</p><p>ENCODE&rsquo;s second phase saw a switch to sequencing-based technologies, the addition of new assay types and the analysis of functional elements genome-wide, described in a collection of research articles in 2012.</p><p><span>The&nbsp;</span><a href="https://www.nature.com/articles/s41586-020-2493-4">Encyclopedia paper of ENCODE 3</a><span>, published in&nbsp;</span><em>Nature</em><span>, gives an overview of the various assays that were performed in human and mouse cell lines and tissues and describes a Registry of human and mouse candidate&nbsp;</span><em>cis</em><span>-regulatory elements (cCREs).</span></p><p>More at&nbsp;<a href="https://www.nature.com/immersive/d42859-020-00027-2/index.html">https://www.nature.com/immersive/d42859-020-00027-2/index.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</guid>
	<pubDate>Sat, 03 Jun 2023 20:15:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</link>
	<title><![CDATA[Metabuli 분리 improves metagenomic read classification]]></title>
	<description><![CDATA[<p><span>Metabuli 분리 improves metagenomic read classification through metamers, DNA-AA k-mers, to be sensitive and specific, recovering 99% and 98% of DNA or AA classifiers.</span></p>
<p>&nbsp;</p>
<p><span><span>Metabuli is metagenomic classifier that jointly analyze both DNA and amino acid (AA) sequences. DNA-based classifiers can make specific classifications, exploiting point mutations to distinguish close taxa. AA-based classifiers have higher sensitivity in detecting homology between query and reference sequences, leverageing higher conservation of AA sequences. Metabuli combines the information of both sequence types using a novel k-mer structure,&nbsp;</span><em>metamer</em><span>, to enable both specific and sensitive characterization of metagenomic samples. In addition, it can classify reads against a database of any size as long as it fits in the hard disk.</span> </span></p><p>Address of the bookmark: <a href="https://github.com/steineggerlab/Metabuli" rel="nofollow">https://github.com/steineggerlab/Metabuli</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</guid>
	<pubDate>Tue, 17 Sep 2024 02:34:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</link>
	<title><![CDATA[SVbyEye: R Package to visualize alignments between two or multiple DNA sequences]]></title>
	<description><![CDATA[<p dir="auto">R Package to visualize alignments between two or multiple DNA sequences including<br>a number of functionalities to facilitate processing of alignments in PAF format.</p>
<p dir="auto"><span>SVbyEye, an open-source R package to visualize and annotate sequence-to-sequence alignments along with various functionalities to process alignments in PAF format. The tool facilitates the characterization of complex SVs in the context of sequence homology helping resolve the mechanisms underlying their formation. Availability and implementation SVbyEye is available at https://github.com/daewoooo/SVbyEye.</span></p>
<p dir="auto">Author: David Porubsky</p><p>Address of the bookmark: <a href="https://github.com/daewoooo/SVbyEye" rel="nofollow">https://github.com/daewoooo/SVbyEye</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/42693/dna-rna-meme</guid>
	<pubDate>Thu, 28 Jan 2021 11:23:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/42693/dna-rna-meme</link>
	<title><![CDATA[DNA RNA MEME]]></title>
	<description><![CDATA[<p>Explain the DNA and RNA with picture ...</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/42693" length="41627" type="image/jpeg" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/25400/arraygen-next-generation-genome-browser-coming-soon</guid>
	<pubDate>Thu, 03 Dec 2015 05:52:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/25400/arraygen-next-generation-genome-browser-coming-soon</link>
	<title><![CDATA[ArrayGen Next Generation Genome Browser Coming Soon !!!]]></title>
	<description><![CDATA[<p>The ANG genome browser is a visualization tool, developed by ArrayGen Technologies. This is a fast and an efficient genome browser, built with Javafx and Java swing. ANG genome browser was built for latest next generation sequencing data analysis. It is platform independent and much simpler to use.</p><p>The main features are, it supports many standard file formats such as GFF, BED, GTF, FASTA, VCF, BAM and it can be integrated with other browsers or tools for analysis of genome.</p>]]></description>
	<dc:creator>ArrayGen Technologies</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29208/srf-bioinformatics-job-position-in-national-institute-of-plant-genome-research-nipgr</guid>
  <pubDate>Mon, 19 Sep 2016 05:43:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF Bioinformatics job position in National Institute of Plant Genome Research (NIPGR)]]></title>
  <description><![CDATA[
<p>SRF Bioinformatics job position in National Institute of Plant Genome Research (NIPGR)<br />Title : “Transcriptome and small RNA diversity analysis of developing seed contrasting rice varieties” <br />Qualification : Candidates having M.Sc./M.Tech. degree or equivalent (with minimum 60% marks) in Bioinformatics with a minimum of two years of post M.Sc./M.Tech research experience are eligible to apply.<br />No. of Post : 01<br />How to apply<br />Application should reach to Dr. Pinky Agarwal, Staff Scientist, National Institute of Plant Genome Research (NIPGR) Aruna Asaf Ali Marg, P.O. Box NO. 10531, New Delhi - 110067 on or before 30/09/2016</p>

<p>More at http://www.nipgr.res.in/careers/vacancies_latest.php#</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</guid>
	<pubDate>Thu, 15 Feb 2018 10:21:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</link>
	<title><![CDATA[Tallymer: method to compute K-mer frequencies and its application to annotate large repetitive plant genomes]]></title>
	<description><![CDATA[<p>Tallymer is based on enhanced suffix arrays. This gives a much larger flexibility concerning the choice of the&nbsp;<span>k</span>-mer size. Tallymer can process large data sizes of several billion bases. We used it in a variety of applications to study the genomes of maize and other plant species. In particular, Tallymer was used to index a set whole genome shotgun sequences from maize (B73) (total size 10<sup>9</sup>&nbsp;bp).&nbsp;<br>Tallymer was effective in a variety of applications to aid genome annotation in maize, despite limitations imposed by the relatively low coverage of sequence available.</p>
<p>A manual can be found&nbsp;<a href="https://www.zbh.uni-hamburg.de/fileadmin/gi/tallymer/tallymer.pdf" target="_blank" title="tallymer.pdf (111 KB)">here</a>.</p><p>Address of the bookmark: <a href="https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html" rel="nofollow">https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/933/world-of-omics</guid>
	<pubDate>Tue, 16 Jul 2013 17:11:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/933/world-of-omics</link>
	<title><![CDATA[World of Omics]]></title>
	<description><![CDATA[<p>How many variants of "omics" techniques presently in use ?</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>