<?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/42645?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/related/42645?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39872/miropeats-discovers-regions-of-sequence-similarity-amongst-any-set-of-dna-sequences</guid>
	<pubDate>Mon, 26 Aug 2019 17:55:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39872/miropeats-discovers-regions-of-sequence-similarity-amongst-any-set-of-dna-sequences</link>
	<title><![CDATA[Miropeats: discovers regions of sequence similarity amongst any set of DNA sequences]]></title>
	<description><![CDATA[<p><span>Miropeats discovers regions of sequence similarity amongst any set of DNA sequences and then presents this similarity information graphically. Sequence similarity searching is a very general tool that forms the basis of many different biological sequence analyses but it is limited by the verbosity of traditional alignment presentation styles. Miropeats enhances the utility of conventional DNA sequence comparisons when looking at long lengths of sequence similarity by summarizing extensive large scale sequence similarities on a single page of graphics. The latest version of Miropeats can be used as a general pairwise alignment program or in its traditional role sorting out a big mess of overlapping or similar regions.</span></p><p>Address of the bookmark: <a href="http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/" rel="nofollow">http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</guid>
	<pubDate>Fri, 31 Jan 2020 02:36:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</link>
	<title><![CDATA[Complete genome sequence of Wuhan seafood market pneumonia virus is out !]]></title>
	<description><![CDATA[<p>Wuhan-Hu-1 claimed at least 40 lives and infected at least 1300 others in China. Cases are now being reported from Thailand, Singapore, Malaysia, South Korea, Japan, Vietnam, Nepal, France, Australia and even as far as the US.&nbsp;On Jan 10 2020, while news of the first fatality was barely trickling in, the <a href="https://www.ncbi.nlm.nih.gov/nuccore/MN908947">29,903 letters</a> constituting the viral genome from an affected individual in Wuhan had already been elucidated (even though a few corrections were made subsequently). All the viral genome sequences from affected individuals are very very close to each other. Several are identical and none has more than 5 differences (99.983% similarity). This strongly suggests that transmission into humans came from a single pointed source and happened very recently, between Sep-Dec 2019.</p><p>Check out the detail at https://www.ncbi.nlm.nih.gov/nuccore/MN908947</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41562/submit-your-sars-cov-2-sequence-data-to-genbank</guid>
	<pubDate>Thu, 09 Apr 2020 18:28:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41562/submit-your-sars-cov-2-sequence-data-to-genbank</link>
	<title><![CDATA[Submit your SARS-CoV-2 sequence data to GenBank]]></title>
	<description><![CDATA[<div dir="auto">Submit your SARS-CoV-2 sequence data to GenBank and SRA with our new submission landing page. Submission is simple and streamlined *and* there&rsquo;s a rapid turnaround. <span><a href="https://l.facebook.com/l.php?u=https%3A%2F%2Fsubmit.ncbi.nlm.nih.gov%2Fsarscov2%2F%3Ffbclid%3DIwAR3p-OzZPe2yx4CZMoZxiWMF3kUQjXyVVduNQhBdehWmFTJ3cPBstsOLypI&amp;h=AT2d-umit7ciXRW-nrRYVL3gJSLKY4Hte8W8cXw8Wl94n6PGmoHmVqvvhgQj-mTo6A5lpMP9JDV_lRSq9RRLT5KeVVAAfcuRgJOeA6QhApIB2B9nFxUfDCD3sio4HYidpRwpmng&amp;__tn__=-UK-R&amp;c[0]=AT2zWGa1K5EvV4UcnB0b7HHvkBtX-wAyh7AF8_fZ9uI2y-02nOHQHT_Um3xgnto5KEZ26wRG0xNgUWTA1W-7HF0E25E23XtIL5XGOhloBXaDIcHw30AVjTCkQi7aFk4dN7aBCmVJeSbH37urtbM2kmMfyTCbdTvMU8FGlnX-DNVuCaZr4XfXnf_jvPNdxe9sBH84oXJ-uJz5kbqlHGAHDoqK" target="_blank">https://submit.ncbi.nlm.nih.gov/sarscov2/</a></span></div><div dir="auto">&nbsp;</div><div dir="auto"><span><span>Quickly and easily add your SARS-CoV-2 sequence data to the growing public archive with new, special features and support from NCBI. </span><a href="https://submit.ncbi.nlm.nih.gov/sarscov2/">new SARS-CoV-2 sequence submission landing page</a><span>&nbsp;will help you get started. GenBank submissions are accessioned and released in approximately 1-2 working days, and&nbsp;</span><a href="https://www.ncbi.nlm.nih.gov/sra" target="_blank">Sequence Read Archive</a><span>&nbsp;(SRA) submissions typically processed and released within hours. Submission is simple!</span></span></div><div><div dir="auto">&nbsp;</div><div dir="auto">More information is available on NCBI Insights. <span><a href="https://l.facebook.com/l.php?u=https%3A%2F%2Fncbiinsights.ncbi.nlm.nih.gov%2F2020%2F04%2F09%2Fsars-cov2-data-streamlined-submission-rapid-turnaround%2F%3Ffbclid%3DIwAR1OuLu3oDjz3VX4fDq5Jg316td9foTOUGNqnoN1eI2nFXTf4EBv28JiXD4&amp;h=AT0ah_epxwAc-nM6QiPBYvKSQ-kWmiPgHKO1w7SnxnnRiTI4etJJfNAWyzcR7snIdtxtcErAFRdHPBH2j0EY77gUPDdnBVnAsxnVbSgZnrrOPfnni331A37Xvytgnye0ArnUuWk&amp;__tn__=-UK-R&amp;c[0]=AT2zWGa1K5EvV4UcnB0b7HHvkBtX-wAyh7AF8_fZ9uI2y-02nOHQHT_Um3xgnto5KEZ26wRG0xNgUWTA1W-7HF0E25E23XtIL5XGOhloBXaDIcHw30AVjTCkQi7aFk4dN7aBCmVJeSbH37urtbM2kmMfyTCbdTvMU8FGlnX-DNVuCaZr4XfXnf_jvPNdxe9sBH84oXJ-uJz5kbqlHGAHDoqK" target="_blank">https://ncbiinsights.ncbi.nlm.nih.gov/2020/04/09/sars-cov2-data-streamlined-submission-rapid-turnaround/</a></span></div></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37982/raven-a-software-suite-for-matlab-that-allows-for-semi-automated-reconstruction-of-genome-scale-models</guid>
	<pubDate>Wed, 24 Oct 2018 22:38:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37982/raven-a-software-suite-for-matlab-that-allows-for-semi-automated-reconstruction-of-genome-scale-models</link>
	<title><![CDATA[RAVEN: a software suite for Matlab that allows for semi-automated reconstruction of genome-scale models]]></title>
	<description><![CDATA[<p><span>The RAVEN (Reconstruction, Analysis and Visualization of Metabolic Networks) Toolbox 2 is a software suite for Matlab that allows for semi-automated reconstruction of genome-scale models (GEMs). It makes use of published models and/or KEGG, MetaCyc databases, coupled with extensive gap-filling and quality control features. The software suite also contains methods for visualizing simulation results and omics data, as well as a range of methods for performing simulations and analyzing the results. The software is a useful tool for system-wide data analysis in a metabolic context and for streamlined reconstruction of metabolic networks based on protein homology.</span></p><p>Address of the bookmark: <a href="https://github.com/SysBioChalmers/RAVEN" rel="nofollow">https://github.com/SysBioChalmers/RAVEN</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17873/postdoc-position-in-protein-annotation-and-machine-learning-paris-france</guid>
  <pubDate>Sat, 04 Oct 2014 08:10:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc position in protein annotation and machine learning - Paris, France]]></title>
  <description><![CDATA[
<p>We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of Paris.</p>

<p>Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.</p>

<p>This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.</p>

<p>The postdoc will be payed under a contract of Ingénieur de Recherche lasting 3.5 years and it is available from September 1st, 2014.</p>

<p>Group Web Page: http://www.lcqb.upmc.fr/AnalGenom/home.html</p>

<p>Ref. E-Mail: Alessandra Carbone alessandra.carbone@lip6.fr</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39269/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</guid>
	<pubDate>Wed, 17 Apr 2019 19:45:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39269/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</link>
	<title><![CDATA[RaGOO: Fast Reference-Guided Scaffolding of Genome Assembly Contigs]]></title>
	<description><![CDATA[<p>Alonge M, Soyk S, Ramakrishnan S, Wang X, Goodwin S, Sedlazeck FJ, Lippman ZB, Schatz MC:&nbsp;<a href="https://www.biorxiv.org/content/early/2019/01/13/519637">Fast and accurate reference-guided scaffolding of draft genomes</a>.&nbsp;<em>bioRxiv</em>&nbsp;2019.</p>
<p>RaGOO is a tool for coalescing genome assembly contigs into pseudochromosomes via minimap2 alignments to a closely related reference genome. The focus of this tool is on practicality and therefore has the following features:</p>
<ol>
<li>Good performance. On a MacBook Pro using Arabidopsis data, pseudochromosome construction takes less than a minute and the whole pipeline with SV calling takes ~2 minutes.</li>
<li>Intact ordering and orienting of contigs.</li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Breaking-Chimeric-Contigs">Chimeric contig correction</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/GFF-File-Lift-Over">GFF lift-over</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Calling-Structural-Variants">Structural variant calling with and integrated version of Assemblytics</a></li>
<li>Confidence scores associated with the grouping, localization, and orientation for each contig.</li>
</ol><p>Address of the bookmark: <a href="https://github.com/malonge/RaGOO" rel="nofollow">https://github.com/malonge/RaGOO</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42310/dada2-fast-and-accurate-sample-inference-from-amplicon-data-with-single-nucleotide-resolution</guid>
	<pubDate>Tue, 10 Nov 2020 20:26:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42310/dada2-fast-and-accurate-sample-inference-from-amplicon-data-with-single-nucleotide-resolution</link>
	<title><![CDATA[DADA2: Fast and accurate sample inference from amplicon data with single-nucleotide resolution]]></title>
	<description><![CDATA[<p>The&nbsp;<a href="https://benjjneb.github.io/dada2/tutorial.html">DADA2 tutorial</a>&nbsp;goes through a typical workflow for paired end Illumina Miseq data: raw amplicon sequencing data is processed into the table of exact&nbsp;<strong>amplicon sequence variants (ASVs)</strong>&nbsp;present in each sample.</p>
<p>The&nbsp;<a href="https://benjjneb.github.io/dada2/bigdata.html">DADA2 Workflow on Big Data</a>&nbsp;goes through workflow optimized to run on large datasets (10s of millions to billions of reads).</p>
<p>An&nbsp;<a href="https://benjjneb.github.io/dada2/ITS_workflow.html">ITS-specific version of the DADA2 workflow</a>&nbsp;identifies and verifiably removes primers on both ends of each ITS read, a key step due to the variable length of the ITS region.</p>
<p>Short demonstrations of&nbsp;<a href="https://benjjneb.github.io/dada2/assign.html">assigning taxonomy</a>&nbsp;and&nbsp;<a href="https://benjjneb.github.io/dada2/assign.html">assigning species</a>&nbsp;to sequences.</p><p>Address of the bookmark: <a href="https://benjjneb.github.io/dada2/index.html" rel="nofollow">https://benjjneb.github.io/dada2/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</guid>
	<pubDate>Tue, 12 Dec 2017 17:30:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</link>
	<title><![CDATA[Mash: fast genome and metagenome distance estimation using MinHash]]></title>
	<description><![CDATA[<p>Mash is normally distributed as a dependency-free binary for Linux or OSX (see&nbsp;<a href="https://github.com/marbl/Mash/releases">https://github.com/marbl/Mash/releases</a>). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC &gt;= 4.8 and OSX &gt;= 10.7.</p>
<p>See&nbsp;<a href="http://mash.readthedocs.org/">http://mash.readthedocs.org</a>&nbsp;for more information.</p><p>Address of the bookmark: <a href="https://github.com/marbl/Mash/releases" rel="nofollow">https://github.com/marbl/Mash/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</guid>
	<pubDate>Thu, 24 May 2018 08:33:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</link>
	<title><![CDATA[minialign: fast and accurate alignment tool for PacBio and Nanopore long reads]]></title>
	<description><![CDATA[Minialign is a little bit fast and moderately accurate nucleotide sequence alignment tool designed for PacBio and Nanopore long reads. It is built on three key algorithms, minimizer-based index of the minimap overlapper, array-based seed chaining, and SIMD-parallel Smith-Waterman-Gotoh extension.<p>Address of the bookmark: <a href="https://github.com/ocxtal/minialign" rel="nofollow">https://github.com/ocxtal/minialign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37937/frodock-20-fast-protein%E2%80%93protein-docking-server</guid>
	<pubDate>Wed, 17 Oct 2018 04:31:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37937/frodock-20-fast-protein%E2%80%93protein-docking-server</link>
	<title><![CDATA[FRODOCK 2.0: fast protein–protein docking server]]></title>
	<description><![CDATA[<p><span>frodock: a&nbsp;user-friendly protein&ndash;protein docking server based on an improved version of FRODOCK that includes a complementary knowledge-based potential. The web interface provides a very effective tool to explore and select protein&ndash;protein models and interactively screen them against experimental distance constraints. The competitive success rates and efficiency achieved allow the retrieval of reliable potential protein&ndash;protein binding conformations that can be further refined with more computationally demanding strategies.</span></p><p>Address of the bookmark: <a href="http://frodock.chaconlab.org/" rel="nofollow">http://frodock.chaconlab.org/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>