<?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/32376?offset=760</link>
	<atom:link href="https://bioinformaticsonline.com/related/32376?offset=760" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/30130/scaffmatch</guid>
	<pubDate>Tue, 13 Dec 2016 10:23:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</link>
	<title><![CDATA[ScaffMatch]]></title>
	<description><![CDATA[<p>caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one needs to first map reads to contigs (instead of providing .sam files).</p>
<p>The arguments accepted by ScaffMatch are:</p>
<p>&nbsp; -w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;</p>
<p>&nbsp; -c) Contig fasta file;</p>
<p>&nbsp; -m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;</p>
<p>&nbsp; -1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;</p>
<p>&nbsp; -2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;</p>
<p>&nbsp; -i) (Comma separated list of) insert size(s) of the library(-ies);</p>
<p>&nbsp; -s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);</p>
<p>&nbsp; -t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;</p>
<p>&nbsp; -g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;</p>
<p>&nbsp; -l) Log file - where to store the logs. Optional argument. By default, stdout is used.</p><p>Address of the bookmark: <a href="http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch" rel="nofollow">http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30153/e-mem-efficient-computation-of-maximal-exact-matches</guid>
	<pubDate>Thu, 15 Dec 2016 09:30:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30153/e-mem-efficient-computation-of-maximal-exact-matches</link>
	<title><![CDATA[E-MEM: Efficient computation of Maximal Exact Matches]]></title>
	<description><![CDATA[<p>E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM.&nbsp;<br><br>E-MEM source code</p>
<p>The source code can be downloaded&nbsp;<a href="http://www.csd.uwo.ca/~ilie/E-MEM/e-mem.zip">here</a>.&nbsp;<br><br>If you use E-MEM, please cite:</p>
<ul>
<li>N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes,&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/31/4/509.short">Bioinformatics</a>&nbsp;<strong>31</strong>(4) (2015) 509 -- 514.</li>
</ul>
<p>For any questions, please contact Lucian Ilie:&nbsp;<a href="mailto:ilie@uwo.ca">ilie@uwo.ca</a>&nbsp;</p><p>Address of the bookmark: <a href="http://www.csd.uwo.ca/~ilie/E-MEM/" rel="nofollow">http://www.csd.uwo.ca/~ilie/E-MEM/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30212/pear</guid>
	<pubDate>Mon, 19 Dec 2016 09:28:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30212/pear</link>
	<title><![CDATA[PEAR]]></title>
	<description><![CDATA[<p><strong>PEAR</strong>&nbsp;is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory.</p>
<p>PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.</p><p>Address of the bookmark: <a href="http://sco.h-its.org/exelixis/web/software/pear/doc.html" rel="nofollow">http://sco.h-its.org/exelixis/web/software/pear/doc.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/30245/venkatesh-lab</guid>
  <pubDate>Tue, 20 Dec 2016 04:38:01 -0600</pubDate>
  <link></link>
  <title><![CDATA[Venkatesh Lab]]></title>
  <description><![CDATA[
<p>We are using a comparative genomics approach to better understand the structure, function and evolution of the human genome. Our group is one of the pioneers in the field of comparative genomics. We proposed the compact genome of the fugu (Takifugu rubripes) as a model vertebrate genome in 1993 (Nature 366: 265-268, 1993) and determined its whole genome sequence in 2002 (Science 297: 1301-1310, 2002).</p>

<p>More at <br />https://zfin.org/ZDB-LAB-110408-1<br />http://www.imcb.a-star.edu.sg/php/venkatesh.php</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30331/16th-congress-of-the-european-society-for-evolutionary-biology-eseb</guid>
  <pubDate>Thu, 22 Dec 2016 08:08:37 -0600</pubDate>
  <link></link>
  <title><![CDATA[16th Congress of the European Society for Evolutionary Biology (ESEB)]]></title>
  <description><![CDATA[
<p>Abstract submissions for our upcoming symposium on the Genomics of Adaptation that will take place as part of the 16th Congress of the European Society for Evolutionary Biology (ESEB). The conference will take place from August 20th - August 25th, 2017 in Groningen, the Netherlands. </p>

<p>SYMPOSIUM DESCRIPTION: Genomics of Adaptation [S16] Model organisms for life-history research are mainly studied in the lab where functional genetics is assessable. In general, however, knowledge about their eco-evolutionary dynamics, such as biotic interactions, is rare. By contrast, in organisms for which the ecology and adaptation strategies in the field are well known, we typically lack the appropriate genetic tools to investigate functionality. Advances in genomics and statistics as well as investments in evolutionary model organisms are now providing access to putatively adaptive genome-wide variation within species from across the tree of life. In this symposium, we focus on integrating life-history biology, genetics and evolutionary ecology in the genomics era. </p>

<p>We wish to (1) highlight the role of genetic architecture of complex traits, such as adaptations to biotic interactions or life-history traits; (2) contrast this to morphological traits which are generally thought to have a less complex genetic architecture; and (3) discuss the opportunities and drawbacks of specific model systems. </p>

<p>INVITED SPEAKERS: Josephine Pemberton, University of Cambridge (http://bit.ly/2hJWytJ ) Peter Tiffin, University of Minnesota (http://bit.ly/2hK7HuS ) </p>

<p>ABSTRACT SUBMISSION The deadline for abstract submission is January 10, 2017. For more information and to submit abstracts online, please visit: http://bit.ly/2fBXlvN We look forward to an exciting symposium and seeing you all in Groningen! Sincerely, Ben Blackman, UC Berkeley Maaike de Jong, University of Bristol Bart Pannebakker, Wageningen University Noah Whiteman, UC Berkeley Jelle Zandveld, Wageningen University</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/30364/bioinformatics-contest-2017</guid>
	<pubDate>Fri, 23 Dec 2016 14:03:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/30364/bioinformatics-contest-2017</link>
	<title><![CDATA[Bioinformatics Contest 2017!]]></title>
	<description><![CDATA[<p><a href="http://contest.bioinf.me" target="_blank">Bioinformatics Contest 2017</a>! Rosalind is co-organizer.<br /> Compete with thousands of people worldwide on bioinformatics problem solving.<br /> Everything is online. Qualification round starts on <strong>January 23, 2017</strong>. Final is on <span><span>Feb 18</span></span>.</p><p>You will need to solve bioinformatics problems using programming. The goal is to correctly solve as many problems as possible within 24 hours. Some of them will be approximation problems and will have partial grades. All rounds will be held online, submissions will be auto-graded in real time.</p><p>Check more at http://contest.bioinf.me/</p><p>Good luck!</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30540/progressive-cactus</guid>
	<pubDate>Tue, 17 Jan 2017 03:40:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30540/progressive-cactus</link>
	<title><![CDATA[Progressive Cactus]]></title>
	<description><![CDATA[<h1><em style="font-size: 12.8px; font-weight: normal;">v0.0 by Glenn Hickey (<a href="mailto:hickey@soe.ucsc.edu">hickey@soe.ucsc.edu</a>)</em></h1>
<p>Progressive Cactus is a whole-genome alignment package.</p>
<h3><a href="https://github.com/glennhickey/progressiveCactus#requirements"></a>Requirements</h3>
<ul>
<li>git</li>
<li>gcc 4.2 or newer</li>
<li>python 2.7</li>
<li>wget</li>
<li>64bit processor and build environment</li>
<li>150GB+ of memory on at least one machine when aligning mammal-sized genomes; less memory is needed for smaller genomes.</li>
<li>Parasol or SGE for cluster support.</li>
<li>750M disk space</li>
</ul>
<h3><a href="https://github.com/glennhickey/progressiveCactus#instructions"></a>Instructions</h3>
<p>IMPORTANT NOTE: Progressive Cactus does not presently support installation into paths that contain spaces. Until this is resolved, you can use a softlink as a workaround: ln -s "path with spaces" "installation path without spaces"</p>
<p>In the parent directory of where you want Progressive Cactus installed:</p>
<pre><code>git clone git://github.com/glennhickey/progressiveCactus.git
cd progressiveCactus
git pull
git submodule update --init
make
</code></pre>
<p>It is also convenient to add the location of&nbsp;<code>progressiveCactus/bin</code>&nbsp;to your PATH environment variable. In order to run the included tools (ex hal2maf) in the submodules/ directory structure, first source&nbsp;<code>progressiveCactus/environment</code>&nbsp;to load the installed environment.</p>
<p>If any errors occur during the build process, you are unlikely to be able to use the tool. Please submit a GitHub issue so we can help out: not only will you help yourself, but others who wish to use the tool as well.</p>
<p><em>Note that all dependencies are also built and included in the submodules/ directory. This increases the size and build time but greatly simplifies installation and version management. The installation does not create or modify any files outside the progressiveCactus/ directory.</em></p><p>Address of the bookmark: <a href="https://github.com/glennhickey/progressiveCactus" rel="nofollow">https://github.com/glennhickey/progressiveCactus</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/32853/progressivecactus</guid>
	<pubDate>Thu, 18 May 2017 05:29:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32853/progressivecactus</link>
	<title><![CDATA[progressiveCactus]]></title>
	<description><![CDATA[<p><span>Progressive Cactus is a whole-genome alignment package.</span></p>
<p><span><span>Distribution package for the Prgressive Cactus multiple genome aligner. Dependencies are linked as submodules</span></span></p>
<p>https://github.com/glennhickey/progressiveCactus</p><p>Address of the bookmark: <a href="https://github.com/glennhickey/progressiveCactus" rel="nofollow">https://github.com/glennhickey/progressiveCactus</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>