<?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/39200?offset=160</link>
	<atom:link href="https://bioinformaticsonline.com/related/39200?offset=160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/11144/scientists-map-17294-proteins-produced-in-human-body</guid>
	<pubDate>Thu, 29 May 2014 01:57:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/11144/scientists-map-17294-proteins-produced-in-human-body</link>
	<title><![CDATA[Scientists map 17,294 proteins produced in human body]]></title>
	<description><![CDATA[<p>Indian scientists missed the genomic profiling bus, but they've more than made up for it by creating the first human proteome map which is an extension of the genomic study. Till now, here is no direct equivalent for the human proteome. But recently two groups present mass spectrometry-based analysis of human tissues, body fluids and cells mapping the large majority of the human proteome.</p><p>The Indian scientists working in Bangalore, along with their American counterparts, have mapped more than 17,000 proteins in 30 organs of the human body. Just like the human genome was sequenced around the turn of the millennium, this is an equivalent mapping of the human proteome.<br /><br />The researcher estimated there are around 20,500 proteins in the human body. These scientists have profiled around 17,294, which account for around 84% of the total proteins. Apart from this, the team also traced around 2,500 of 3,000 proteins that had been categorised as "missing proteins".</p><p>The work, done by group of Indian scientists, and Johns Hopkins University, published in the renowned journal Nature ( http://www.nature.com/nature/journal/v509/n7502/full/nature13302.html ). Of the 72 people who worked on the project, 46 are Indians.</p><p>Reference:</p><p>http://www.nature.com/nature/journal/v509/n7502/full/nature13302.html</p><p>http://www.proteinatlas.org/ -The antibody-based Human Protein Atlas programme</p><p>http://www.humanproteomemap.org/ -Proteogenomic analysis by identifying translated proteins from annotated pseudogenes, non-coding RNAs and untranslated regions.</p><p>https://www.proteomicsdb.org/ -Assembled protein evidence for 18,097 genes in ProteomicsDB</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</guid>
	<pubDate>Tue, 10 May 2016 08:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</link>
	<title><![CDATA[segemehl]]></title>
	<description><![CDATA[<p><span>segemehl is a software to map short sequencer reads to reference genomes. Unlike other methods, segemehl is able to detect not only mismatches but also insertions and deletions. Furthermore, segemehl is not limited to a specific read length and is able to map&nbsp;primer- or polyadenylation contaminated reads correctly.&nbsp; segemehl implements a matching strategy based on enhanced suffix arrays (ESA).&nbsp;</span></p>
<p><span>More at&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/</span></p>
<p><span>Manual&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/segemehl_manual_0_1_7.pdf</span></p><p>Address of the bookmark: <a href="http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html" rel="nofollow">http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</guid>
	<pubDate>Wed, 14 Dec 2016 15:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</link>
	<title><![CDATA[BIMA V3: an aligner customized for mate pair library sequencing]]></title>
	<description><![CDATA[<p>Summary: Mate pair library sequencing is an effective and economical method for detecting genomic structural variants and chromosomal abnormalities. Unfortunately, the mapping and alignment of mate pair read pairs to a reference genome is a challenging and <br>time consuming process for most NGS alignment programs. Large insert sizes, introduction of library preparation protocol artifacts (biotin junction reads, paired-end read contamination, chimeras, etc.), and presence of structural variant breakpoints within reads increases mapping and alignment complexity. We describe an algorithm that is up to 20 times faster and 25% more accurate than popular NGS alignment programs when processing mate pair sequencing. <br>Availability: http://bioinformaticstools.mayo.edu/research/bima/ <br>Contact: vasmatzis.george@mayo.edu</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</guid>
	<pubDate>Tue, 14 Aug 2018 18:11:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</link>
	<title><![CDATA[NCBI Magic-BLAST]]></title>
	<description><![CDATA[<p>Magic-BLAST is a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome. Each alignment optimizes a composite score, taking into account simultaneously the two reads of a pair, and in case of RNA-seq, locating the candidate introns and adding up the score of all exons. This is very different from other versions of BLAST, where each exon is scored as a separate hit and read-pairing is ignored.</p>
<p>Magic-BLAST incorporates within the NCBI BLAST code framework ideas developed in the NCBI Magic pipeline, in particular hit extensions by local walk and jump&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26109056">(http://www.ncbi.nlm.nih.gov/pubmed/26109056)</a>, and recursive clipping of mismatches near the edges of the reads, which avoids accumulating artefactual mismatches near splice sites and is needed to distinguish short indels from substitutions near the edges.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ncbi.github.io/magicblast/" rel="nofollow">https://ncbi.github.io/magicblast/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44229/common-steps-for-reads-mapping</guid>
	<pubDate>Thu, 09 Mar 2023 02:48:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44229/common-steps-for-reads-mapping</link>
	<title><![CDATA[Common steps for reads mapping !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Mapping reads to a reference genome is an essential step in many types of genomic analysis, such as variant calling and gene expression analysis. Here are some general steps to follow for mapping reads to a genome:</p><ol>
<li>
<p>Choose a read mapper: There are many read mappers available, such as BWA, Bowtie, and HISAT2. Choose a mapper that is appropriate for your type of data and research question.</p>
</li>
<li>
<p>Index the reference genome: Before mapping reads, the reference genome needs to be indexed. This involves creating an index of the genome sequence that allows the mapper to quickly find matches to the reads. Most mappers have their own indexing tools.</p>
</li>
<li>
<p>Prepare the read data: The reads should be in a format that is compatible with the mapper. Most mappers accept FASTQ or BAM files. Depending on the quality of the data, it may need to be filtered or trimmed before mapping.</p>
</li>
<li>
<p>Run the mapper: The mapper is run with the command-line interface or using a graphical user interface. The specific command depends on the mapper being used, but typically involves specifying the input data, reference genome, and output file format.</p>
</li>
<li>
<p>Evaluate the mapping results: After the mapping is complete, the results should be evaluated. This includes assessing the quality of the mapping, such as the mapping rate, the number of mapped reads, and the mapping quality score.</p>
</li>
<li>
<p>Post-processing: Depending on the analysis being performed, post-processing of the mapped reads may be necessary. This can include filtering reads based on quality, removing duplicate reads, and calling variants.</p>
</li>
</ol><p>Overall, mapping reads to a reference genome is a complex process that requires careful consideration of the type of data, the research question, and the specific mapper being used.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27225/painless-package-development-for-r</guid>
	<pubDate>Tue, 03 May 2016 05:31:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27225/painless-package-development-for-r</link>
	<title><![CDATA[Painless package development for R]]></title>
	<description><![CDATA[<p>Devtools makes package development a breeze: it works with R&rsquo;s existing conventions for code structure, adding efficient tools to support the cycle of package development. With devtools, developing a package becomes so easy that it will be your default layout whenever you&rsquo;re writing a significant amount of code.</p>
<p>Before you get started be sure to check out:</p>
<ul>
<li><a href="https://groups.google.com/forum/#%21forum/rdevtools" title="Google devtools Group">devtools Google Group &ndash;&nbsp;https://groups.google.com/forum/#!forum/rdevtools</a></li>
<li><a href="http://adv-r.had.co.nz/" title="Hadley W Online Book">book on &ldquo;Advanced R programming&rdquo; &ndash;&nbsp;http://adv-r.had.co.nz/</a></li>
<li><a href="https://github.com/hadley/devtools" title="devtools GitHub">GitHub repository &ndash;&nbsp;https://github.com/hadley/devtools</a></li>
</ul>
<h3 id="getting_started">&nbsp;</h3><p>Address of the bookmark: <a href="https://www.rstudio.com/products/rpackages/devtools/" rel="nofollow">https://www.rstudio.com/products/rpackages/devtools/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36746/soap2-short-oligonucleotide-analysis-package-2</guid>
	<pubDate>Wed, 23 May 2018 10:09:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36746/soap2-short-oligonucleotide-analysis-package-2</link>
	<title><![CDATA[SOAP2 : Short Oligonucleotide Analysis Package 2]]></title>
	<description><![CDATA[SOAPaligner/soap2 is a member of the SOAP (Short Oligonucleotide Analysis Package). It is an updated version of SOAP software for short oligonucleotide alignment. The new program features in super fast and accurate alignment for huge amounts of short reads generated by Illumina/Solexa Genome Analyzer. Compared to soap v1, it is one order of magnitude faster. It require only 2 minutes aligning one million single-end reads onto the human reference genome. Another remarkable improvement of SOAPaligner is that it now supports a wide range of the read length.

SOAPaligner benefitted in time and space efficiency by a revolution in the basic data structures and algorithms used.The core algorithms and the indexing data structures (2way-BWT) are developed by the algorithms research group of the Department of Computer Science, the University of Hong Kong (T.W. Lam, Alan Tam, Simon Wong, Edward Wu and S.M. Yiu).<p>Address of the bookmark: <a href="http://soap.genomics.org.cn/soapaligner.html" rel="nofollow">http://soap.genomics.org.cn/soapaligner.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41691/genobuntu-package-for-next-generation-sequencing-and-genome-assembly</guid>
	<pubDate>Mon, 18 May 2020 16:47:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41691/genobuntu-package-for-next-generation-sequencing-and-genome-assembly</link>
	<title><![CDATA[Genobuntu: Package for Next Generation Sequencing and Genome Assembly]]></title>
	<description><![CDATA[<div>
<p>Genobuntu is a software package containing more than 70 software and packages oriented towards NGS. In its current version, Genobuntu supports pre assembly tools, genome assemblers as well as post assembly tools.<br><br>Commonly used biological software and example script files for different assembly pipelines have also been provided, where the example script files can be updated to suit one&rsquo;s experimental needs. Genobuntu attempts to reduce the amount of time and energy needed to build software workstations and it can also act as a good teaching source for a class room setting.<br><br>Therefore, Genobuntu offers a well-tailored environment for both novices and experts working in the field of genome assembly.</p>
</div>
<div>
<h3>Features</h3>
<ul>
<li>Velvet</li>
<li>MiB</li>
<li>SSAKE</li>
<li>EULER</li>
<li>VCAKE</li>
<li>ABySS</li>
<li>ALLPATHS</li>
<li>Celera</li>
<li>SHARCGS</li>
<li>Allpaths</li>
<li>IDBA</li>
<li>TAIPAN</li>
<li>Edena</li>
<li>SOAPdenovo</li>
<li>Maq</li>
<li>IDBA-UD</li>
<li>No. of Reads present in the Ref. Seq.</li>
<li>ART NGS Reads Simulator</li>
<li>HiTEC, FASTQC</li>
<li>Minimum Description Length</li>
<li>SOAPaligner</li>
<li>Sequencing Read Archive Toolkit</li>
</ul>
</div><p>Address of the bookmark: <a href="https://sourceforge.net/projects/genobuntu/" rel="nofollow">https://sourceforge.net/projects/genobuntu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38646/visnetwork-an-r-package-for-network-visualization-using-visjs-javascript-library</guid>
	<pubDate>Wed, 09 Jan 2019 11:00:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38646/visnetwork-an-r-package-for-network-visualization-using-visjs-javascript-library</link>
	<title><![CDATA[visNetwork: an R package for network visualization, using vis.js javascript library]]></title>
	<description><![CDATA[<div id="introduction">
<p><strong>visNetwork</strong>&nbsp;is an R package for network visualization, using&nbsp;<strong>vis.js</strong>&nbsp;javascript library (<a href="http://visjs.org/">http://visjs.org/</a>). All remarks and bugs are welcome on github :&nbsp;<a href="https://github.com/datastorm-open/visNetwork">https://github.com/datastorm-open/visNetwork</a>.</p>
</div>
<div id="features">
<h2>Features</h2>
<p>Based on&nbsp;<a href="http://www.htmlwidgets.org/">htmlwidgets</a>, so :</p>
<ul>
<li>compatible with&nbsp;<a href="http://shiny.rstudio.com/">shiny</a>, R Markdown documents, and RStudio viewer</li>
</ul>
<p>The package proposes all the features available in&nbsp;<strong>vis.js</strong>&nbsp;API, and even more with special features for R :</p>
<ul>
<li>easy to use</li>
<li>custom shapes, styles, colors, sizes, &hellip;</li>
<li>works smooth on any modern browser for up to a few thousand nodes and edges</li>
<li>interactivity controls (highlight, collapsed nodes, selection, zoom, physics, movement of nodes, tooltip, events, &hellip;)</li>
<li>visualize&nbsp;<code>rpart</code>&nbsp;tree</li>
<li></li>
</ul>
</div><p>Address of the bookmark: <a href="https://datastorm-open.github.io/visNetwork/" rel="nofollow">https://datastorm-open.github.io/visNetwork/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39114/plumberan-r-package-that-converts-your-existing-r-code-to-a-web-api</guid>
	<pubDate>Wed, 13 Mar 2019 19:20:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39114/plumberan-r-package-that-converts-your-existing-r-code-to-a-web-api</link>
	<title><![CDATA[plumber:An R package that converts your existing R code to a web API]]></title>
	<description><![CDATA[<p>plumber allows you to create a REST API by merely decorating your existing R source code with special comments. Take a look at an example.</p>
<pre><code><span># plumber.R
</span><span>
</span><span>#* Echo back the input
#* @param msg The message to echo
#* @get /echo
</span><span>function</span><span>(</span><span>msg</span><span>=</span><span>""</span><span>){</span><span>
  </span><span>list</span><span>(</span><span>msg</span><span> </span><span>=</span><span> </span><span>paste0</span><span>(</span><span>"The message is: '"</span><span>,</span><span> </span><span>msg</span><span>,</span><span> </span><span>"'"</span><span>))</span><span>
</span><span>}</span><span>

</span><span>#* Plot a histogram
#* @png
#* @get /plot
</span><span>function</span><span>(){</span><span>
  </span><span>rand</span><span> </span><span>&lt;-</span><span> </span><span>rnorm</span><span>(</span><span>100</span><span>)</span><span>
  </span><span>hist</span><span>(</span><span>rand</span><span>)</span><span>
</span><span>}</span><span>

</span><span>#* Return the sum of two numbers
#* @param a The first number to add
#* @param b The second number to add
#* @post /sum
</span><span>function</span><span>(</span><span>a</span><span>,</span><span> </span><span>b</span><span>){</span><span>
  </span><span>as.numeric</span><span>(</span><span>a</span><span>)</span><span> </span><span>+</span><span> </span><span>as.numeric</span><span>(</span><span>b</span><span>)</span><span>
</span><span>}</span></code></pre><p>Address of the bookmark: <a href="https://www.rplumber.io/" rel="nofollow">https://www.rplumber.io/</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>

</channel>
</rss>