<?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/31105?offset=1320</link>
	<atom:link href="https://bioinformaticsonline.com/related/31105?offset=1320" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41996/wgd%E2%80%94simple-command-line-tools-for-the-analysis-of-ancient-whole-genome-duplications</guid>
	<pubDate>Thu, 23 Jul 2020 05:49:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41996/wgd%E2%80%94simple-command-line-tools-for-the-analysis-of-ancient-whole-genome-duplications</link>
	<title><![CDATA[wgd—simple command line tools for the analysis of ancient whole-genome duplications]]></title>
	<description><![CDATA[<p><span>wgd is a easy to use command-line tool for<span>&nbsp;</span></span><em>K</em><sub>S</sub><span><span>&nbsp;</span>distribution construction named wgd. The wgd suite provides commonly used<span>&nbsp;</span></span><em>K</em><sub>S</sub><span><span>&nbsp;</span>and colinearity analysis workflows together with tools for modeling and visualization, rendering these analyses accessible to genomics researchers in a convenient manner.</span></p>
<p><a href="https://academic.oup.com/bioinformatics/article/35/12/2153/5162749">https://academic.oup.com/bioinformatics/article/35/12/2153/5162749</a></p><p>Address of the bookmark: <a href="https://github.com/arzwa/wgd" rel="nofollow">https://github.com/arzwa/wgd</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30015/scripts</guid>
	<pubDate>Wed, 30 Nov 2016 10:35:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30015/scripts</link>
	<title><![CDATA[Scripts]]></title>
	<description><![CDATA[<p>Useful script for NGS analysis.</p><p>Address of the bookmark: <a href="http://augustus.gobics.de/binaries/scripts/" rel="nofollow">http://augustus.gobics.de/binaries/scripts/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43268/kmer-a-suite-of-tools-for-dna-sequence-analysis</guid>
	<pubDate>Wed, 18 Aug 2021 00:02:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43268/kmer-a-suite-of-tools-for-dna-sequence-analysis</link>
	<title><![CDATA[Kmer: a suite of tools for DNA sequence analysis]]></title>
	<description><![CDATA[<p>More at&nbsp;https://help.rc.ufl.edu/doc/Kmer</p>
<p>This also includes:</p>
<ul>
<li>A2Amapper: ATAC, Assembly to Assembly Comparision tool:
<ul>
<li>Comparative mapping between two genome assemblies (same species), or between two different genomes (cross species).</li>
</ul>
</li>
</ul>
<ul>
<li>Sim4db:
<ul>
<li>Spliced alignment of cDNA and genomic sequences, from the same (sim4) or related (sim4cc) species. Optimized for high-throughput batched alignment.</li>
</ul>
</li>
</ul>
<ul>
<li>LEAFF:
<ul>
<li>LEAFF (ahem, Let's Extract Anything From Fasta) is a utility program for working with multi-fasta files. In addition to providing random access to the base level, it includes several analysis functions.</li>
</ul>
</li>
</ul>
<ul>
<li>Meryl:
<ul>
<li>An out-of-core k-mer counter. The amount of sequence that can be processed for any size k depends only on the amount of free disk space.</li>
</ul>
</li>
</ul><p>Address of the bookmark: <a href="https://help.rc.ufl.edu/doc/Kmer" rel="nofollow">https://help.rc.ufl.edu/doc/Kmer</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30102/prism</guid>
	<pubDate>Sat, 10 Dec 2016 15:19:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30102/prism</link>
	<title><![CDATA[PRISM]]></title>
	<description><![CDATA[<p><span>PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.&nbsp;</span><br><br><span>PRISM and PRISM_CTX were originally designed and written by&nbsp;</span><a href="http://www.cs.toronto.edu/~brudno">Michael Brudno</a><span>&nbsp;and Yue Jiang, The original PRISM publication can be found&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2012/07/31/bioinformatics.bts484.abstract">here</a><span>.&nbsp;</span><br><br><span>The authors may be contacted via e-mail at:&nbsp;</span><em>prism at cs.toronto.edu</em><span>.&nbsp;</span><br><br><span>Additional information is available in the&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_README">PRISM README</a><span>&nbsp;file and&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_CTX_README">PRISM_CTX README</a><span>&nbsp;file.&nbsp;</span></p>
<p>http://compbio.cs.toronto.edu/prism/</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/prism/" rel="nofollow">http://compbio.cs.toronto.edu/prism/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43902/interactivenn-a-web-based-tool-for-the-analysis-of-sets-through-venn-diagrams</guid>
	<pubDate>Wed, 29 Jun 2022 03:22:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43902/interactivenn-a-web-based-tool-for-the-analysis-of-sets-through-venn-diagrams</link>
	<title><![CDATA[InteractiVenn: a web-based tool for the analysis of sets through Venn diagrams]]></title>
	<description><![CDATA[<p><span>InteractiVenn, a more flexible tool for interacting with Venn diagrams including up to six sets. It offers a clean interface for Venn diagram construction and enables analysis of set unions while preserving the shape of the diagram. Set unions are useful to reveal differences and similarities among sets and may be guided in our tool by a tree or by a list of set unions. The tool also allows obtaining subsets&rsquo; elements, saving and loading sets for further analyses, and exporting the diagram in vector and image formats. InteractiVenn has been used to analyze two biological datasets, but it may serve set analysis in a broad range of domains.</span></p>
<p><span>More at&nbsp;https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0611-3</span></p>
<p><span><img src="https://media.springernature.com/lw685/springer-static/image/art%3A10.1186%2Fs12859-015-0611-3/MediaObjects/12859_2015_611_Fig1_HTML.gif?as=webp" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="http://www.interactivenn.net/" rel="nofollow">http://www.interactivenn.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30334/postdoc-at-ubritishcolumbia-in-troutgenomics</guid>
  <pubDate>Thu, 22 Dec 2016 08:18:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoc at UBritishColumbia in TroutGenomics]]></title>
  <description><![CDATA[
<p>Landscape Genomics Postdoc at UBC A research team at the University of British Columbia’s Department of Zoology and Biodiversity Research Centre is seeking a postdoctoral researcher in landscape genetics of native rainbow trout (Oncorhynchus mykiss). </p>

<p>This project is part of a larger Genome Canada project on genetics and physiology of adaptation to climate change in rainbow trout, and the population genomics component is in the labs of Eric Taylor and Michael Whitlock. The landscape genomics component primarily involves whole genome sequencing approaches to understanding the genomic basis of adaptation to features of habitat, but also to provide insights into phylogeography and the influence of watershed structure on population subdivision in rainbow trout. A PhD in a related field with expertise in basic theory and bioinformatic analysis of population genomics data is required. </p>

<p>The position is available for one year with renewal for up to three additional years. Salary is $55,000 per year plus benefits. To apply, please send a brief cover letter summarizing your qualifications for the position, a CV, and the names, addresses, phone numbers and emails of three references. </p>

<p>Review of applications will begin January 16, 2017. Address application materials to etaylor@zoology.ubc.ca to whom any questions can also be addressed. etaylor@zoology.ubc.ca</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</guid>
	<pubDate>Mon, 10 Jul 2017 05:56:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</link>
	<title><![CDATA[Omega2: metagenome assembly pipeline]]></title>
	<description><![CDATA[<p><span>Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph and then merged to contigs and scaffolds using mate-pair information. In comparison with three de Bruijn graph assemblers (SOAPdenovo, IDBA-UD and MetaVelvet), Omega provided comparable overall performance on a HiSeq 100-bp dataset and superior performance on a MiSeq 300-bp dataset. In comparison with Celera on the MiSeq dataset, Omega provided more continuous assemblies overall using a fraction of the computing time of existing overlap-layout-consensus assemblers. This indicates Omega can more efficiently assemble longer Illumina reads, and at deeper coverage, for metagenomic datasets.</span></p><p>Address of the bookmark: <a href="http://omega.omicsbio.org/" rel="nofollow">http://omega.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30657/studentship</guid>
  <pubDate>Tue, 24 Jan 2017 04:26:14 -0600</pubDate>
  <link></link>
  <title><![CDATA[Studentship]]></title>
  <description><![CDATA[
<p>Advt. No. ACBR/BTBI/BIF/Manpower/ADV/16-17<br />Research Associate/ Studentship/ Traineeship Jobs opportunity in  University of Delhi - Dr. B.R. Ambedkar Center for Biomedical Research (ACBR) on temporary basis<br />Studentship<br />No. of Post : 01<br />Qualifications : Applicants who are pursuing Post Graduate Degree course/ Diploma in Bioinformatics/ Biomedical Sciences/ Biotechnology/Life Sciences/Chemistry/ Biochemistry with a programme in Bioinformatics to carry out the project.<br />Remuneration : Rs. 8,000/-<br />Traineeship<br />No. of Post : 01<br />Qualifications : Applicants who have completed their Post Graduate degree in Bioinformatics /Biomedical Sciences/Biotechnology/Life Sciences/Chemistry/Biochemistry or any other branch of Life Sciences with knowledge in Bioinformatics<br />Remuneration : Rs. 8,000/-<br />Research Associate<br />No. of Post : 01<br />Qualifications : Ph.D. in Bio-Medical Sciences/Bioinformatics/ Biotechnology/Life Sciences/ Chemistry/ Bio-Chemistry and related areas<br />Remuneration : Rs. 36,000/-</p>

<p>Applicant are required to bring applications on plain paper, stating the name, address, date of birth. educational qualifications and experiences and Institute, along with attested photocopies of mark sheets and certificates etc. at the time of Interview. Applications should also be sent by Entail to Dr. Madhu Chopra, Coordinator, BIF Facility. Email: acbrdu.blisnet@nic.in;  mchopradu@gmail.com.<br />Interview Date : 13.02.2017<br />Time : 10:00 am-12:00 noon<br />Venue : ACBR</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30696/many-core-engine-mce-for-perl-example</guid>
	<pubDate>Tue, 31 Jan 2017 05:37:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30696/many-core-engine-mce-for-perl-example</link>
	<title><![CDATA[Many-Core Engine (MCE) for Perl example]]></title>
	<description><![CDATA[<p><span>MCE spawns a pool of workers and therefore does not fork a new process per each element of data. Instead, MCE follows a bank queuing model. Imagine the line being the data and bank-tellers the parallel workers. MCE enhances that model by adding the ability to chunk the next n elements from the input stream to the next available worker.</span></p>
<p>CORE MODULES</p>
<p>Three modules make up the core engine for MCE.</p>
<dl><dt id="MCE::Core"><a href="https://metacpan.org/pod/MCE#MCE::Core"><span></span></a><a></a><a href="https://metacpan.org/pod/distribution/MCE/lib/MCE/Core.pod">MCE::Core</a></dt><dd>
<p>Provides the Core API for Many-Core Engine. The various MCE options are described here.</p>
</dd><dt id="MCE::Signal"><a href="https://metacpan.org/pod/MCE#MCE::Signal"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Signal">MCE::Signal</a></dt><dd>
<p>Temporary directory creation, cleanup, and signal handling.</p>
</dd><dt id="MCE::Util"><a href="https://metacpan.org/pod/MCE#MCE::Util"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Util">MCE::Util</a></dt><dd>
<p>Utility functions for Many-Core Engine.</p>
</dd></dl>
<p><a href="https://metacpan.org/pod/MCE#MCE-EXTRAS"><span></span></a><a></a>MCE EXTRAS</p>
<p>There are 4 add-on modules for use with MCE.</p>
<dl><dt id="MCE::Candy"><a href="https://metacpan.org/pod/MCE#MCE::Candy"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Candy">MCE::Candy</a></dt><dd>
<p>Provides a collection of sugar methods and output iterators for preserving output order.</p>
</dd><dt id="MCE::Mutex"><a href="https://metacpan.org/pod/MCE#MCE::Mutex"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Mutex">MCE::Mutex</a></dt><dd>
<p>Provides a simple semaphore implementation supporting threads and processes.</p>
</dd><dt id="MCE::Queue"><a href="https://metacpan.org/pod/MCE#MCE::Queue"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Queue">MCE::Queue</a></dt><dd>
<p>Provides a hybrid queuing implementation for MCE supporting normal queues and priority queues from a single module. MCE::Queue exchanges data via the core engine to enable queuing to work for both children (spawned from fork) and threads.</p>
</dd><dt id="MCE::Relay"><a href="https://metacpan.org/pod/MCE#MCE::Relay"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Relay">MCE::Relay</a></dt><dd>
<p>Enables workers to receive and pass on information orderly with zero involvement by the manager process while running.</p>
</dd></dl>
<p><a href="https://metacpan.org/pod/MCE#MCE-MODELS"><span></span></a><a></a>MCE MODELS</p>
<p>The models take Many-Core Engine to a new level for ease of use. Two options (chunk_size and max_workers) are configured automatically as well as spawning and shutdown.</p>
<dl><dt id="MCE::Loop"><a href="https://metacpan.org/pod/MCE#MCE::Loop"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Loop">MCE::Loop</a></dt><dd>
<p>Provides a parallel loop utilizing MCE for building creative loops.</p>
</dd><dt id="MCE::Flow"><a href="https://metacpan.org/pod/MCE#MCE::Flow"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Flow">MCE::Flow</a></dt><dd>
<p>A parallel flow model for building creative applications. This makes use of user_tasks in MCE. The author has full control when utilizing this model. MCE::Flow is similar to MCE::Loop, but allows for multiple code blocks to run in parallel with a slight change to syntax.</p>
</dd><dt id="MCE::Grep"><a href="https://metacpan.org/pod/MCE#MCE::Grep"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Grep">MCE::Grep</a></dt><dd>
<p>Provides a parallel grep implementation similar to the native grep function.</p>
</dd><dt id="MCE::Map"><a href="https://metacpan.org/pod/MCE#MCE::Map"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Map">MCE::Map</a></dt><dd>
<p>Provides a parallel map model similar to the native map function.</p>
</dd><dt id="MCE::Step"><a href="https://metacpan.org/pod/MCE#MCE::Step"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Step">MCE::Step</a></dt><dd>
<p>Provides a parallel step implementation utilizing MCE::Queue between user tasks. MCE::Step is a spin off from MCE::Flow with a touch of MCE::Stream. This model, introduced in 1.506, allows one to pass data from one sub-task into the next transparently.</p>
</dd><dt id="MCE::Stream"><a href="https://metacpan.org/pod/MCE#MCE::Stream"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Stream">MCE::Stream</a></dt><dd>
<p>Provides an efficient parallel implementation for chaining multiple maps and greps together through user_tasks and MCE::Queue. Like with MCE::Flow, MCE::Stream can run multiple code blocks in parallel with a slight change to syntax from MCE::Map and MCE::Grep.</p>
</dd></dl>
<p><a href="https://metacpan.org/pod/MCE#MISCELLANEOUS"><span></span></a>MISCELLANEOUS</p>
<p>Miscellaneous additions included with the distribution.</p>
<dl><dt id="MCE::Examples"><a href="https://metacpan.org/pod/MCE#MCE::Examples"><span></span></a><a></a><a href="https://metacpan.org/pod/distribution/MCE/lib/MCE/Examples.pod">MCE::Examples</a></dt><dd>
<p>Describes various demonstrations for MCE including a Monte Carlo simulation.</p>
</dd><dt id="MCE::Subs"><a href="https://metacpan.org/pod/MCE#MCE::Subs"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Subs">MCE::Subs</a></dt><dd>
<p>Exports functions mapped directly to MCE methods; e.g. mce_wid. The module allows 3 options; :manager, :worker, and :getter.</p>
</dd></dl>
<p><a href="https://metacpan.org/pod/MCE#REQUIREMENTS"><span></span></a>REQUIREMENTS</p>
<p>Perl 5.8.0 or later. PDL::IO::Storable is required in scripts running PDL.</p>
<p><a href="https://metacpan.org/pod/MCE#SOURCE-AND-FURTHER-READING"><span></span></a><a></a>SOURCE AND FURTHER READING</p>
<p>The source, cookbook, and examples are hosted at GitHub.</p>
<ul>
<li>
<p><a href="https://github.com/marioroy/mce-perl">https://github.com/marioroy/mce-perl</a></p>
</li>
<li>
<p><a href="https://github.com/marioroy/mce-cookbook">https://github.com/marioroy/mce-cookbook</a></p>
</li>
<li>
<p><a href="https://github.com/marioroy/mce-examples">https://github.com/marioroy/mce-examples</a></p>
</li>
</ul>
<p><a href="https://metacpan.org/pod/MCE#SEE-ALSO"><span></span></a><a></a>SEE ALSO</p>
<p><code>MCE::Shared</code>&nbsp;provides data sharing capabilities for&nbsp;<code>MCE</code>. It includes&nbsp;<code>MCE::Hobo</code>&nbsp;for running code asynchronously.</p>
<ul>
<li>
<p><a href="https://metacpan.org/pod/MCE::Shared">MCE::Shared</a></p>
</li>
<li>
<p><a href="https://metacpan.org/pod/MCE::Hobo">MCE::Hobo</a></p>
</li>
</ul><p>Address of the bookmark: <a href="https://github.com/marioroy/mce-examples" rel="nofollow">https://github.com/marioroy/mce-examples</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>