<?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/28200?offset=770</link>
	<atom:link href="https://bioinformaticsonline.com/related/28200?offset=770" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29280/nemo-%E2%80%93-a-stochastic-individual-base-genetically-explicit-simulation-platform</guid>
	<pubDate>Sat, 01 Oct 2016 14:45:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29280/nemo-%E2%80%93-a-stochastic-individual-base-genetically-explicit-simulation-platform</link>
	<title><![CDATA[Nemo – A stochastic, individual-base, genetically explicit simulation platform]]></title>
	<description><![CDATA[<ul>
<li>
<p>A&nbsp;<strong>recombination map</strong>&nbsp;has been added for all multi-locus traits. The map positions (chromosomal) for neutral markers (e.g. SNPs) and loci under selection (QTLs, deleterious mutations, DMIs) can now be specified explicitly, or set at random. The map can hold an unlimited number of loci of different types jointly, at any recombination scale (cM or lower). The effects of linkage can thus be finely explored.</p>
</li>
<li>
<p>A new trait coding for (Bateson-)<strong>Dobzhansky-Muller incompatibility loci</strong>. Multiple haploid or diploid pairs of incompatible loci can be spread throughout the genome and affect individual fitness.</p>
</li>
<li>
<p><strong>Multi-type selection</strong>:&nbsp;<a href="http://nemo2.sourceforge.net/classIndividual.html" title="This class contains traits along with other individual information (sex, pedigree, etc. ).">Individual</a>&nbsp;fitness can be jointly determined by different types of loci under selectinon, such as QTLs coding for quantitative traits under spatially variable selection, universally deleterious mutations, and Dobzhansky-Muller incompatibility loci.</p>
</li>
<li>
<p><strong>An unlimited number of quantitative traits</strong>&nbsp;under different forms of selection can be modelled, based on universally pleiotropic loci with several bi- or multi-allelic models.</p>
</li>
<li>
<p><strong>Spatial and temporal variation of selection</strong>&nbsp;on quantitative traits is possible, modelling shifts of environmental conditions over time.</p>
</li>
<li>
<p>The dispersal matrix describing the movement of individuals among sub-populations can be replaced by a connectivity matrix and a reduced dispersal matrix describing migration only among the connected sub-populations. This offers a substantial gain in computing time and system memory when simulating very large grids.</p>
</li>
<li>
<p>Input parameters' arguments may be specified in separate files. This is particularly convenient when specifying large matrices.</p>
</li>
<li>
<p>Many adjustments have been made for refined control of the input of parameters and data output. See updates in the manual.</p>
</li>
</ul><p>Address of the bookmark: <a href="http://nemo2.sourceforge.net/index.html" rel="nofollow">http://nemo2.sourceforge.net/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29379/bbmap-help</guid>
	<pubDate>Mon, 10 Oct 2016 06:29:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29379/bbmap-help</link>
	<title><![CDATA[BBMap help]]></title>
	<description><![CDATA[<div>
<div>BBMAP <span> &bull; <span>a solution for everything</span></span><a href="https://www.biostarhandbook.com/"><span></span></a></div>
<div>That content has been reformatted and it is being expanded to include more information.<span><span></span></span></div>
</div>
<hr>
<p>There are common options for most BBMap suite programs and depending on the file extension the input/output format is automatically chosen/set.</p>
<hr>
<h3>Using BBMap</h3>
<h4>Mapping Nanopore reads</h4>
<p>BBMap.sh has a length cap of 6kbp. Reads longer than this will be broken into 6kbp pieces and mapped independently.</p>
<p>More at https://www.biostarhandbook.com/tools/bbmap/bbmap-help.html</p><p>Address of the bookmark: <a href="https://www.biostarhandbook.com/tools/bbmap/bbmap-help.html" rel="nofollow">https://www.biostarhandbook.com/tools/bbmap/bbmap-help.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29574/beagle</guid>
	<pubDate>Thu, 27 Oct 2016 11:19:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29574/beagle</link>
	<title><![CDATA[Beagle]]></title>
	<description><![CDATA[<p>Beagle is a software package that performs genotype calling, genotype phasing, imputation of ungenotyped markers, and identity-by-descent segment detection.</p>
<p>Beagle version 4.1 has a more accurate genotype phasing algorithm and a very fast and accurate genotype imputation algorithm. Version 4.1 also has several changes to the command line arguments which are described in the&nbsp;<a href="http://faculty.washington.edu/browning/beagle/release_notes" target="_blank">release notes</a>. The "ped" argument has no effect in version 4.1. If your data contains nuclear families and you want to model the parent-offspring relationships when phasing genotypes, please use&nbsp;<a href="https://faculty.washington.edu/browning/beagle/b4_0.html">version 4.0</a>.</p>
<p>If you use Beagle 4.1 in a published analysis, please report the program version and cite the appropriate article.</p>
<p>The citation for Beagle's phasing algorithm is:</p>
<p>S R Browning and B L Browning (2007) Rapid and accurate haplotype phasing and missing data inference for whole genome association studies by use of localized haplotype clustering. Am J Hum Genet 81:1084-1097.<a href="http://dx.doi.org/doi:10.1086/521987" target="_blank">doi:10.1086/521987</a></p>
<p>The citation for Beagle's genotype imputation algorithm is:</p>
<p>B L Browning and S R Browning (2016). Genotype imputation with millions of reference samples. Am J Hum Genet 98:116-126.<a href="http://dx.doi.org/doi:10.1016/j.ajhg.2015.11.020" target="_blank">doi:10.1016/j.ajhg.2015.11.020</a></p>
<p>The citation for Beagle's IBD detection algorithm is:</p>
<p>B L Browning and S R Browning (2013). Improving the accuracy and efficiency of identity-by-descent detection in population data. Genetics 194(2):459-71.<a href="http://dx.doi.org/doi:10.1534/genetics.113.150029" target="_blank">doi:10.1534/genetics.113.150029</a></p><p>Address of the bookmark: <a href="http://faculty.washington.edu/browning/beagle/beagle.html" rel="nofollow">http://faculty.washington.edu/browning/beagle/beagle.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29644/junior-research-fellow-at-rajiv-gandhi-centre-for-biotechnology-thiruvananthapuram</guid>
  <pubDate>Mon, 07 Nov 2016 10:27:06 -0600</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow at Rajiv Gandhi Centre for Biotechnology, Thiruvananthapuram]]></title>
  <description><![CDATA[
<p>Adv. # 22/ 2016<br />Applications are invited from suitable candidates for one position of Junior Research Fellow in a DST funded bioinformatics research project entitled "Major gene influxes in microbial genome evolution" in the Laboratory of Dr. Shijulal Nelson-Sathi at Rajiv Gandhi Centre for Biotechnology, Thiruvananthapuram.</p>

<p>ESSENTIAL QUALIFICATIONS:<br />We are looking for a motivated candidate with keen interest in bioinformatics and microbial genome evolution. The candidate must have a Master’s Degree in Bioinformatics, Computational Biology, Computer Science, Microbiology, Biology or a related field with good academic record.</p>

<p>DESIRABLE QUALIFICATIONS<br />Hands on research experience on handling next generation sequencing data and phylogenetic reconstruction methods. Excellent programming skills (Perl/Python/Java/Php) and experience in working on Unix/Linux platform is preferred. Furthermore; good knowledge is required in statistics (R/Matlab) and the application of bioinformatics analysis tools.</p>

<p>AGE:<br />Below 28 years as on 15th November, 2016.</p>

<p>EMOLUMENTS:<br />Rs. 25,000 + 20% HRA for NET/GATE qualified and Post Graduate in Professional Degree course qualified candidates and <br />Rs. 12,000/- + 20% HRA for others.</p>

<p>DURATION:<br />Initial appointment will be given for one year and further extension will be based on the performance till termination of the project.<br />Only those fulfilling the above criteria need apply and will be called for interview. In the event of more than 10 candidates being short-listed by screening the applications, a written test will be conducted before the selection interview and only those who are successful in the written test will be interviewed. No TA/ DA will be given for appearing in the interview.</p>

<p>Suitably qualified candidates may send applications in the prescribed format (Download here) with a photograph, a copy of full resume indicating the percentage of Marks obtained and attested photocopies of credentials &amp; experience to reach the undersigned on or before 15th November, 2016. Envelopes must be superscripted with abbreviated title of the project, advertisement number and job title. Selection to the position will not entitle the candidate to any future positions at RGCB (permanent or otherwise). As with all project positions at RGCB, the position will be co terminus with end of the project.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29883/ra-bioinformatics-at-school-of-computational-integrative-sciences-jnu-india</guid>
  <pubDate>Fri, 18 Nov 2016 03:57:56 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at School of Computational &amp; Integrative Sciences, JNU, India]]></title>
  <description><![CDATA[
<p>School of Computational &amp; Integrative Sciences<br />Jawaharlal Nehru University<br />New Delhi – 110067</p>

<p>Date: Nov 11th. 2016                                                            Last Date:  Nov 25th. 2016</p>

<p>PROJECT ID: 632</p>

<p>The following posts are urgently required to be filled for the Department of Biotechnology, Government of India funded project entitled "Computational Core for Plant Metabolomics" administrated by Prof Indira Ghosh,  School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi-110 067</p>

<p>NB:For all Bioinformatics posts, preference will be given to candidates with a good knowledge of Python and/or R. Knowledge of JAVA will also get a special consideration.</p>

<p>RA / Research Associate (Metabolic engineering/Computational Biologist)</p>

<p>Salary: Rs. 36000/- + HRA<br />Vacancy: 1<br />Essential Qualifications: PhD in  Bioinformatics /Mathematics/Computer Science with experience in analyzing high throughput omics-based data/ system Biology/ Analysis of Network Biology. Published paper in the field is a must to prove the experience.<br />Desired Skills: Prior experience in handling and guiding bioinformatics, metabolomics data, planning of new research area in metabolic driven network , managing the project portal, preparing and filing reports etc. Will be expected to communicate with user groups and coordinate with LIMS group in Hyderabad and the Cheminformatics group in Delhi.</p>

<p>RA / Research Associate (Chemo-informatics/Computational Biologist)</p>

<p>Salary: Rs. 36000/- + HRA<br />Vacancy: 1<br />Essential Qualifications: PhD in Bioinformatics/ computational biology/ Biophysics/Computer Science. Computational and Chemical structure related experience is a necessary qualification proven by paper published and program developed. <br />Desired Skills:  Research experience in Chemical scaffold mapping, in silico Spectral analysis, Biological Database Designing &amp; Integration is required. Individual is responsible to develop methods related to metabolite identification, Testing and refining and integrate LIMS with IIIT Hyderabad and will be expected to communicate with user groups.</p>

<p>Project SRF (Bioinformatics/Programming)</p>

<p>Salary: As per DBT rules<br />Vacancy: 1<br />Essential Qualifications: Masters/B Tech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Computational Biology related to Database /portal building &amp; maintenance ,high throughput data handling and analysis etc. For M.Sc/B.Tec, Published paper  in peer-reviewed Journal and for M.Tech, thesis submission in computational biology is a must.</p>

<p>More at http://www.jnu.ac.in/Career/currentjobs.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29995/hga</guid>
	<pubDate>Tue, 29 Nov 2016 07:25:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29995/hga</link>
	<title><![CDATA[HGA]]></title>
	<description><![CDATA[<p>HGA tool version 1.0 This tool helps to apply the Hierarchical Genome Assembly (HGA) method. The tool will apply: 1. Partitioning a given reads dataset into a given number of partitions. 2. Assembling each partitions using a pre-specified assembler (Velvet or SPAdes in this version) and using a given kmer size. 3. Merging all the assemblies of the partition. 4. Combining all the assemblies of the partition (using velvet with kmer value of 31). 5. Finaly, re-assembling the whole dataset with the merged contigs or the combined contigs, using a given kmer size.</p>
<p>https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</p><p>Address of the bookmark: <a href="https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA" rel="nofollow">https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30018/bipype</guid>
	<pubDate>Thu, 01 Dec 2016 08:47:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30018/bipype</link>
	<title><![CDATA[bipype]]></title>
	<description><![CDATA[<p><span>Bipype is a very useful program, which prepare a lot of types of bioinformatics analyses. There are three input options: amplicons, WGS (whole genome sequences) and metatranscriptomic data. If amplicons are input data, then bipype does reconstruction and pairs merging. After that biodiversity is searching. There are two types of searching depending on the amplicons types (ITS or 16S). If WGS are chosen, then bipype finds the SA coordinates of the input reads and generates alignments in the SAM format given single-end reads, aligns reads to reference sequence(s). All of these analyses will be shown with Krona program, which allows to show hierarchical data with pie charts.</span></p><p>Address of the bookmark: <a href="https://readthedocs.org/projects/bipype/" rel="nofollow">https://readthedocs.org/projects/bipype/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/30104/structural-variation-the-hidden-genomic-treasure</guid>
	<pubDate>Sat, 10 Dec 2016 16:19:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/30104/structural-variation-the-hidden-genomic-treasure</link>
	<title><![CDATA[Structural variation: the hidden genomic treasure]]></title>
	<description><![CDATA[<p>Genome re-sequencing projects have revealed substantial amounts of genetic variation between individuals extending beyond single nucleotide polymorphisms (SNPs) and short indels. Structural Variations (SVs) and Copy Number Variations (CNVs) are a major source of genomic variation. However, compared to SNPs, accurate detection, genotyping and understanding of CNVs is lagging behind due to much greater analytical challenges related to SV/CNV detection and analysis. In our lab we analyse SVs/CNVs using high-throughput sequencing and different analytical approaches.&nbsp;The most‐studied structural variants are copy number variations (CNVs) which can be generated by several different mechanisms including non‐allelic homologous recombination, non‐homologous end‐joining and deoxyribonucleic acid (DNA) replication‐related fork stalling and template switching. CNVs are closely related to segmental duplications (SDs): SDs can stimulate the formation of CNVs and themselves started out as CNVs, but became fixed in a species. Structural variation can be neutral but has also influenced our phenotypic evolution, for example our susceptibility to disease and our ability to digest certain types of food. Our understanding of the extent of structural variation is increasing rapidly, but it will be much more difficult to understand its phenotypic consequences.&nbsp;</p><p><img src="http://www.nature.com/nmeth/journal/v9/n2/images/nmeth.1858-F3.jpg" alt="image" width="946" height="603" style="border: 0px; border: 0px;"></p><p>Structural variants (SVs) such as deletions, insertions, duplications, inversions and translocations litter genomes and are often associated with gene expression changes and severe phenotypes (ie. genetic diseases in humans). Recent studies on the functional aspects of different types of SVs have unveiled several cases of adaptive evolution. For example, inversions have been associated with ecological adaptations and may facilitate speciation. Due to their prevalent nature, SVs arguably have a large impact on genome evolution and should not be neglected when studying the genetics of adaptation and speciation.&nbsp;SVs were classically defined as chromosomal rearrangements larger than 1kb, but due to a higher resolution of new detection methods, smaller variants (between 50 and 1000 base pairs) can now be accurately assessed. Besides various methods of detection in next generation sequencing data (paired end mapping, split reads, and depth of coverage), array-based approaches have proven to be particularly useful for detecting copy number variations (CNVs). These technologies have enabled researchers to catalog a wide spectrum of SVs in many organisms and infer the effects of selection shaping their evolutionary trajectories.</p><p><strong>Structure variation sequencing signature (Source: NatRev Genetics)</strong></p><p><img src="http://www.nature.com/nrg/journal/v12/n5/images/nrg2958-f2.jpg" alt="image" width="800" height="824" style="border: 0px; border: 0px;"></p><p>Related tools, databases and publications are listed below. If you know any interesing papers, please let us know in comment section:</p><p><br /><strong>Key concepts</strong></p><p>Structural variation includes balanced variants such as inversions and translocations, and unbalanced ones such as duplications and deletions (copy number variations or CNVs).</p><p>Structural variants can arise by several mechanisms, including nonallelic homologous recombination (NAHR), nonhomologous end‐joining (NHEJ) and DNA replication‐based fork stalling and template switching (FoSTeS).</p><p>CNV is closely linked to segmental duplication, but is not exactly the same. Segmental duplications can stimulate CNV formation by NAHR, and themselves arise from CNVs that have become fixed.</p><p>Segmental duplications did not appear uniformly during the evolution of the Great Ape species, but rather during a burst of activity around the time of the divergence of gorilla from the human/chimpanzee ancestor.</p><p>Duplicated genes play a critical role in the evolution of a genome as they act as &lsquo;spare parts&rsquo; than can evolve to perform new or more specialized functions.</p><p>Effects of structural variation on gene expression can be identified but only a few examples of the consequences for species biology have been documented.</p><p><strong style="font-size: 12.8px;">Tools</strong></p><p><a href="http://sv.gersteinlab.org/cnvnator">CNVnator</a>a tool for CNV discovery and genotyping from depth of read mapping.<a href="http://www.ncbi.nlm.nih.gov/pubmed/21293372">2011a</a>,<a href="http://www.ncbi.nlm.nih.gov/pubmed/21324876">2011b</a></p><p><a href="http://sv.gersteinlab.org/age">AGE</a>a tools that implements an algorithm for optimal alignment of sequences with SVs.<a href="http://www.ncbi.nlm.nih.gov/pubmed/21233167">2011</a></p><p><a href="http://sv.gersteinlab.org/breakseq">BreakSeq</a>a pipeline for annotation, classification and analysis of SVs at single nucleotide resolution.<a href="http://www.ncbi.nlm.nih.gov/pubmed/20037582">2010</a></p><p><a href="http://sv.gersteinlab.org/pemer">PEMer</a>a computational and simulation framework for discovering SVs by paired-end read mapping.<a href="http://www.ncbi.nlm.nih.gov/pubmed/19236709">2009</a>,<a href="http://www.ncbi.nlm.nih.gov/pubmed/17901297">2007</a></p><p>GASV https://code.google.com/archive/p/gasv/</p><p>PAIROSCOPE http://pairoscope.sourceforge.net/</p><p>SVDetect&nbsp;http://svdetect.sourceforge.net/Site/Home.html</p><p>BreakPtr, discovery of unbalanced structural variants (copy-number variants) with tiling microarrays&nbsp;<a href="http://tiling.mbb.yale.edu/BreakPtr/" target="_top">Link</a>&nbsp;</p><p>R Package&nbsp;https://www.bioconductor.org/help/course-materials/2010/EMBL2010/Practical-4-StructuralVariants.pdf<br /><br />BreakSeq, structural variant genotyping using split reads&nbsp;<a href="http://sv.gersteinlab.org/breakseq/" target="_top">Link</a>&nbsp;<br /><br />CopySeq, genotyping of unbalanced structural variants (copy-number variants) using read-depth&nbsp;<a href="http://www.korbel.embl.de/CopySeq/" target="_top">Link</a>&nbsp;<br /><br />DELLY2, integrated structural variant discovery, genotyping and visualization in deep sequencing data&nbsp;<a href="https://github.com/dellytools/delly" target="_top">Link</a>&nbsp;<br /><br />PEMer, structural variant discovery in 454 sequencing data by paired-end mapping&nbsp;<a href="http://www.korbel.embl.de/PEMer/" target="_top">Link</a>&nbsp;<br /><br />TIGER, transduction inference in germline genomes using short read data&nbsp;<a href="https://github.com/jelena-tica/TIGER" target="_top">Link</a>&nbsp;</p><p>MANTA&nbsp;https://github.com/Illumina/manta</p><p>SV-Bay&nbsp;https://github.com/InstitutCurie/SV-Bay</p><p>BreakDancer&nbsp;http://breakdancer.sourceforge.net/</p><p>Variation Hunter&nbsp;http://compbio.cs.sfu.ca/software-variation-hunter</p><p>Lumpy&nbsp;https://github.com/arq5x/lumpy-sv</p><p>ForestSV&nbsp;http://sebatlab.ucsd.edu/index.php/software-data&nbsp;</p><p>PBSuites for long reads&nbsp;https://sourceforge.net/projects/pb-jelly/</p><p><strong>Visualization</strong></p><p>The SV visualization tool:&nbsp;<a href="http://genomesavant.com/savant/">http://genomesavant.com/savant/</a></p><p>InGAP-SV (<a href="http://ingap.sourceforge.net/">http://ingap.sourceforge.net/</a>) that is nice tools for both detection and visualisation of severals kind of structural variations (Large insertions, translocation, deletion, inversions....)&nbsp;</p><p>Tools table: http://www.nature.com/nbt/journal/v29/n8/fig_tab/nbt.1904_T2.html</p><p>Variation Viewer https://www.ncbi.nlm.nih.gov/variation/view/</p><p><strong style="font-size: 12.8px;">Papers</strong></p><p>http://www.nature.com/nmeth/journal/v9/n2/full/nmeth.1858.html</p><p>http://journal.frontiersin.org/researchtopic/1412/structural-variations-in-genomes-ecological-and-evolutionary-implications</p><p>http://www.mi.fu-berlin.de/wiki/pub/ABI/GenomicsLecture10Materials/structural-variation.pdf</p><p>http://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-015-1479-3</p><p>https://www.ncbi.nlm.nih.gov/dbvar/content/overview/</p><p>http://www.nature.com/subjects/structural-variation</p><p>https://eichlerlab.gs.washington.edu/news/NatMeth_Feb2012.pdf</p><p>https://www.ncbi.nlm.nih.gov/pubmed/19477992 ***</p><p>https://www.ncbi.nlm.nih.gov/pubmed/22452995</p><p>http://biorxiv.org/content/early/2016/09/06/073833</p><p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4479793/</p><p>http://www.nature.com/articles/srep18501</p><p>http://www.genetics.org/content/202/1/351</p><p>http://www.cs.cmu.edu/~sssykim/teaching/s13/slides/Lecture_SVI.pdf</p><p>https://www.omicsonline.org/open-access/structural-variation-detection-from-next-generation-sequencing-2469-9853-S1-007.php?aid=69055</p><p>http://schatzlab.cshl.edu/presentations/2016/2016.01.12.PAG.Structural%20Variations.pdf</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30149/mypro-a-seamless-pipeline-for-automated-prokaryotic-genome-assembly-and-annotation</guid>
	<pubDate>Thu, 15 Dec 2016 05:47:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30149/mypro-a-seamless-pipeline-for-automated-prokaryotic-genome-assembly-and-annotation</link>
	<title><![CDATA[MyPro: A seamless pipeline for automated prokaryotic genome assembly and annotation]]></title>
	<description><![CDATA[<p>MyPro is an improved genomics software pipeline for prokaryotic genomes. MyPro is user-friendly and requires minimal programming skills. High-quality prokaryotic genome assembly and annotation can be obtained with ease. It performed better than de novo assemblers and contig integration software. Produces more contiguous assemblies, higher N50 values and lower number of contigs.</p>
<p>More at https://sourceforge.net/projects/sb2nhri/files/MyPro/</p><p>Address of the bookmark: <a href="http://www.sciencedirect.com/science/article/pii/S0167701215001207" rel="nofollow">http://www.sciencedirect.com/science/article/pii/S0167701215001207</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</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>

</channel>
</rss>