<?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/44483?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/44483?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44705/pirna-and-bioinformatics-decoding-the-guardians-of-the-genome</guid>
	<pubDate>Sat, 07 Dec 2024 02:15:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44705/pirna-and-bioinformatics-decoding-the-guardians-of-the-genome</link>
	<title><![CDATA[piRNA and Bioinformatics: Decoding the Guardians of the Genome]]></title>
	<description><![CDATA[<p>In the symphony of small RNAs, PIWI-interacting RNAs (piRNAs) stand out as the protectors of genomic integrity. These small, non-coding RNAs play critical roles in silencing transposable elements, regulating gene expression, and maintaining germline stability. The rise of bioinformatics has revolutionized our understanding of piRNAs, enabling researchers to decipher their biogenesis, functions, and evolutionary significance.</p><h3>What Are piRNAs?</h3><p>piRNAs are the largest class of small non-coding RNAs, typically 24&ndash;32 nucleotides in length. Unlike microRNAs (miRNAs) and small interfering RNAs (siRNAs), piRNAs do not rely on Dicer enzymes for maturation. Instead, they are processed from long single-stranded precursors and associate with PIWI proteins, a subclass of the Argonaute protein family.</p><p>The primary functions of piRNAs include:</p><ol>
<li><strong>Silencing Transposable Elements</strong>: By targeting transposons, piRNAs prevent genomic instability, particularly in germline cells.</li>
<li><strong>Regulating Gene Expression</strong>: piRNAs modulate gene expression at transcriptional and post-transcriptional levels.</li>
<li><strong>Epigenetic Modulation</strong>: They guide epigenetic modifications, such as DNA methylation, to specific genomic loci.</li>
</ol><h3>Challenges in piRNA Research</h3><p>Studying piRNAs is fraught with challenges, including:</p><ul>
<li><strong>Short Length</strong>: Their small size complicates sequencing and alignment.</li>
<li><strong>Lack of Sequence Conservation</strong>: Unlike miRNAs, piRNAs exhibit limited sequence conservation across species.</li>
<li><strong>Complex Biogenesis</strong>: The intricate pathways of piRNA generation require sophisticated computational tools to unravel.</li>
</ul><h3>Bioinformatics: Illuminating the World of piRNAs</h3><p>Bioinformatics has emerged as an indispensable tool for studying piRNAs, facilitating their discovery, annotation, and functional analysis. Here's how bioinformatics is transforming piRNA research:</p><h4>1. <strong>Identification and Annotation</strong></h4><p>The discovery of piRNAs relies on next-generation sequencing (NGS) data. Bioinformatics tools such as <em>piRNApredictor</em> and <em>Piano</em> identify piRNA clusters and predict potential targets. Databases like piRBase and piRNAdb curate information about known piRNAs, their sequences, and associated proteins.</p><h4>2. <strong>Mapping and Alignment</strong></h4><p>piRNAs often originate from repetitive regions, making their alignment challenging. Tools like Bowtie and STAR handle the unique mapping requirements of piRNAs, enabling accurate identification of piRNA clusters in genomes.</p><h4>3. <strong>Functional Analysis</strong></h4><p>Bioinformatics approaches predict piRNA functions by analyzing their interactions with transposons, genes, and epigenetic marks. Algorithms such as TargetFinder and RIblast explore piRNA-mRNA interactions, shedding light on regulatory networks.</p><h4>4. <strong>Evolutionary Studies</strong></h4><p>piRNAs are evolutionarily diverse, reflecting their roles in species-specific genomic defense. Comparative genomics tools help trace the evolution of piRNA clusters and their associated PIWI proteins across species.</p><h4>5. <strong>Epigenomic Insights</strong></h4><p>piRNAs are key players in epigenetic regulation. Bioinformatics pipelines integrate piRNA data with chromatin immunoprecipitation sequencing (ChIP-seq) and DNA methylation data to uncover their role in shaping the epigenome.</p><h3>Case Study: piRNAs in Germline Integrity</h3><p>One of the hallmark functions of piRNAs is the suppression of transposable elements in the germline. For example, in <em>Drosophila melanogaster</em>, piRNAs target retrotransposons like <em>gypsy</em> and <em>copia</em>. Bioinformatics analyses revealed that these piRNAs guide PIWI proteins to transposon-derived RNA, ensuring genome stability during gametogenesis.</p><h3>Clinical Relevance of piRNAs</h3><p>Recent studies suggest that piRNAs may serve as biomarkers for diseases such as cancer, infertility, and neurodegenerative disorders. For instance:</p><ul>
<li><strong>Cancer</strong>: Dysregulated piRNA expression has been linked to tumorigenesis, making them potential targets for cancer therapies.</li>
<li><strong>Infertility</strong>: Aberrant piRNA pathways are implicated in male infertility due to their role in spermatogenesis.</li>
<li><strong>Neurodegeneration</strong>: piRNAs may regulate neuronal gene expression, highlighting their potential in neurological research.</li>
</ul><h3>Future Directions</h3><p>The integration of bioinformatics with emerging technologies offers exciting opportunities for piRNA research:</p><ul>
<li><strong>Single-Cell Sequencing</strong>: Unveiling cell-specific piRNA expression and function.</li>
<li><strong>Machine Learning</strong>: Predicting piRNA functions and targets with greater accuracy.</li>
<li><strong>CRISPR-Based Tools</strong>: Editing piRNA clusters to explore their roles in vivo.</li>
</ul><h3>Conclusion</h3><p>piRNAs are the unsung guardians of the genome, safeguarding genetic material from transposable elements and contributing to gene regulation and epigenetic programming. Bioinformatics has opened the floodgates of discovery, unraveling the complexities of piRNAs and their myriad roles in biology and disease.</p><p>As we continue to decode the piRNA landscape, these small RNAs promise to unveil big secrets about genome stability, evolution, and human health, cementing their place as a fascinating frontier in molecular biology.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44770/nvidia-and-arc-institute-unveil-evo-2-a-breakthrough-ai-for-dna-design</guid>
	<pubDate>Fri, 21 Feb 2025 10:39:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44770/nvidia-and-arc-institute-unveil-evo-2-a-breakthrough-ai-for-dna-design</link>
	<title><![CDATA[NVIDIA and Arc Institute Unveil Evo 2: A Breakthrough AI for DNA Design]]></title>
	<description><![CDATA[<p>NVIDIA and the Arc Institute have introduced <strong style="font-size: 12.8px;">Evo 2</strong>, a groundbreaking AI model designed to <strong style="font-size: 12.8px;">understand, predict, and generate DNA sequences</strong>. This marks a major advancement in computational biology, offering scientists an unprecedented tool to decode the genetic blueprint of life and even design entirely new biological systems.</p><h3><strong>The Power of Evo 2: AI Meets DNA</strong></h3><p>Evo 2 is <strong>the largest AI model for biology ever created</strong>, trained on an astonishing <strong>9.3 trillion DNA "letters"</strong> (nucleotides) carefully selected from genomes spanning the entire tree of life. This massive dataset ensures that Evo 2 can recognize patterns and relationships in genetic sequences at an unparalleled scale.</p><p>For the first time, scientists can <strong>design DNA with AI</strong>, moving beyond simple sequence analysis to active DNA generation. Evo 2 enables researchers to <strong>predict, modify, and even create entire genetic sequences</strong>, opening new possibilities in medicine, agriculture, and synthetic biology.</p><h3><strong>Decoding the Dark Genome</strong></h3><p>One of the biggest challenges in genetics is understanding the <strong>non-coding regions</strong> of DNA&mdash;vast stretches of the genome that do not code for proteins but play crucial roles in regulating gene expression. These regions control when and how genes are activated, influencing everything from development to disease.</p><p>Evo 2 is designed to <strong>decode these non-coding elements</strong>, helping researchers uncover their functions and use this knowledge to develop gene-based therapies, synthetic life forms, and precision agriculture solutions.</p><h3><strong>From Reading DNA to Writing It</strong></h3><p>To put Evo 2&rsquo;s impact into perspective:</p><ul>
<li><strong>Previous AI models could "read" DNA</strong> like a book, analyzing genetic sequences and identifying patterns.</li>
<li><strong>Evo 2 can "write" entirely new DNA</strong>, designing functional genes, chromosomes, and even full genomes from scratch.</li>
</ul><p>This means scientists can now <strong>engineer biological systems with AI</strong>, designing new proteins, metabolic pathways, and genetic circuits to address real-world challenges.</p><h3><strong>A Step Toward Generative Biology</strong></h3><p>The Arc Institute describes Evo 2 as a major step toward <strong>"generative biology"</strong>&mdash;a revolutionary approach where AI is used to create <strong>novel biological structures</strong> rather than just analyzing existing ones. This could lead to breakthroughs such as:</p><ul>
<li><strong>New medicines</strong>: AI-generated enzymes and proteins tailored for targeted therapies.</li>
<li><strong>Disease-resistant crops</strong>: Genetically optimized plants for higher yield and climate resilience.</li>
<li><strong>Synthetic organisms</strong>: Custom-designed microbes for bioremediation, biofuel production, and industrial applications.</li>
</ul><h3><strong>An Open-Source Revolution</strong></h3><p>Unlike many proprietary AI models, <strong>Evo 2 is open source</strong>, making its capabilities accessible to researchers worldwide. This democratization of AI-driven biology means that scientists from different disciplines can <strong>collaborate, experiment, and innovate</strong>, accelerating discoveries in genetic engineering and synthetic biology.</p><p>With Evo 2, the boundaries of what&rsquo;s possible in <strong>DNA design, genetic engineering, and biological innovation</strong> are being redrawn. The future of life sciences is no longer just about understanding life&rsquo;s code&mdash;it&rsquo;s about writing it.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42038/pyparanoid-a-pipeline-for-rapid-identification-of-homologous-gene-families-in-a-set-of-genomes</guid>
	<pubDate>Thu, 13 Aug 2020 10:06:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42038/pyparanoid-a-pipeline-for-rapid-identification-of-homologous-gene-families-in-a-set-of-genomes</link>
	<title><![CDATA[PyParanoid: a pipeline for rapid identification of homologous gene families in a set of genomes]]></title>
	<description><![CDATA[<p>PyParanoid is a pipeline for rapid identification of homologous gene families in a set of genomes - a central task of any comparative genomics analysis. The "gold standard" for identifying homologs is to use reciprocal best hits (RBHs) which depends on performing a all-vs-all sequence comparison, usually using BLAST, to determine homology. However, these methods are computationally expensive, requiring&nbsp;O(n2)&nbsp;resources to identify RBHs. This is problematic, as the modern deluge of sequencing data means that comparative genomics analyses could be performed on datasets of thousands of strains.</p><p>Address of the bookmark: <a href="https://github.com/ryanmelnyk/PyParanoid" rel="nofollow">https://github.com/ryanmelnyk/PyParanoid</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34324/orthognc-a-software-for-accurate-identification-of-orthologs-based-on-gene-neighborhood-conservation</guid>
	<pubDate>Tue, 14 Nov 2017 09:30:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34324/orthognc-a-software-for-accurate-identification-of-orthologs-based-on-gene-neighborhood-conservation</link>
	<title><![CDATA[OrthoGNC: A Software for Accurate Identification of Orthologs Based on Gene Neighborhood Conservation]]></title>
	<description><![CDATA[<div>
<p id="sp0005">Orthology relations can be used to transfer annotations from one gene (or protein) to another. Hence, detecting orthology relations has become an important task in the post-genomic era. Various genomic events, such as duplication and horizontal gene transfer, can cause erroneous assignment of orthology relations. In closely-related species, gene neighborhood information can be used to resolve many ambiguities in orthology inference. Here we present OrthoGNC, a software for accurately predicting pairwise orthology relations based on gene neighborhood conservation. Analyses on simulated and real data reveal the high accuracy of OrthoGNC. In addition to orthology detection, OrthoGNC can be employed to investigate the conservation of genomic context among potential orthologs detected by other methods. OrthoGNC is freely available online at http://bs.ipm.ir/softwares/orthognc and http://tinyurl.com/orthoGNC.</p>
<p>http://www.comp.nus.edu.sg/~wongls/projects/orthoGNC/</p>
</div><p>Address of the bookmark: <a href="http://www.sciencedirect.com/science/article/pii/S1672022917301663" rel="nofollow">http://www.sciencedirect.com/science/article/pii/S1672022917301663</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/1897/genetic-test-in-india</guid>
	<pubDate>Sun, 11 Aug 2013 10:54:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/1897/genetic-test-in-india</link>
	<title><![CDATA[Genetic Test in India]]></title>
	<description><![CDATA[<p>1.<strong>Xcode Life Sciences Pvt. Ltd.</strong><br /><span>6B, Eldorado,&nbsp;</span><br /><span>112, Nungambakkam High Road,</span><br /><span>Nungambakkam, Chennai 600034</span><br /><span>Tamil Nadu, India&nbsp;</span></p><p>2.<span><strong>Mapmygenome&trade;</strong><br /></span><span>Royal Demeure,HUDA Techno Enclave,<br />Plot No. 12/2, Sector-1 500 081&nbsp;<br />Madhapur,Hyderabad<br />AP, India</span></p><p>3.<strong>&nbsp;DNA Labs India</strong></p><p><strong><a href="http://www.dnalabsindia.com/lab.php">http://www.dnalabsindia.com/lab.php</a></strong></p><p>&nbsp;</p><p>4.<strong>MedGenome Labs Pvt Ltd</strong><br /><span>(Division of SciGenom Labs Pvt Ltd.)</span><br /><span>Plot no: 43A,SDF, 3rd floor</span><br /><span>A Block,CSEZ, Kakanad, Cochin</span><br /><span>Kerala - 682037&nbsp;</span><br /><span>Phone: 0484 - 2413399</span><br /><span>Fax: 0484 - 2413398</span><br /><span>Email:&nbsp;</span><a href="mailto:info@medgenome.com">info@medgenome.com</a></p><p>5.<strong>Narayana Nethralaya</strong></p><p><span>Narayana Hrudayalaya Campus</span><br /><span>Narayana Health City</span><br /><span># 258/A, Bommasandra, Hosur Road,&nbsp;</span><br /><span>Bangalore - 560 099 - INDIA.</span><br /><span>TEL: +91-80-66660655-0658&nbsp;</span><br /><span>FAX: +91-80-66660650&nbsp;</span><br /><span>Mobile: 9902 821128 (Emergency Only)</span><br /><span>e-mail:&nbsp;</span><a href="mailto:info@narayananethralaya.com">info@narayananethralaya.com</a></p><p>6.<strong>BioAxis DNA Research Centre Private Limited</strong><br />13-51,Sri Lakshmi Nagar colony,<br />Besides Big Bazar, Near Kamineni Hospitals<br />GSI Post BandalGuda (L B Nagar) Hydeabad-500068<br />Andhra Pradesh (<strong>India</strong>).<br />Phone :&nbsp;+91-40-24034503/+91-9246338983</p><p>7.<strong>Gene Guiide</strong></p><p>8th Floor, Embassy Towers, 7 Bungalows Rd, Versova, Andheri West, Mumbai-61&nbsp;<br />&nbsp;09167 117799&nbsp;<br />&nbsp;<a href="mailto:info@geneguiide.com" target="_blank">info@geneguiide.com</a>&nbsp;</p><p>See more at: http://www.geneguiide.com</p><p>8.<strong>INDIAN BIOSCIENCES</strong><br />Regd. Office:<br />G-2 (Ground Floor Rear), Kailash Colony, New Delhi - 110048, India.<br />Phone: +91 (0)11 29236088, Email: info@inbdna.com.</p><p>9.<strong>SRL Limited</strong></p><p>GP-26, MARUTI INDUSTRIAL ESTATE,</p><p>UDYOG VIHAR,SECTOR-18,</p><p>GURGAON - 122015</p><p>Tel: 0124-3001243 / 0124-3001209</p><p><strong>SRL Limited</strong><br />VASANT VIHAR, 8, PALAM MARG,<br />NEW DELHI - 110057<br />Tel: 011 - 4229 5333&nbsp;</p><p><strong>Website:</strong>&nbsp;<a href="http://www.srlworld.com/" target="_blank">http://www.srlworld.com</a><br /><strong>National Customer care number:</strong><br />Call Toll Free : 1800-222-660/1800-102-8282&nbsp;<br /><strong>E-mail id:</strong>&nbsp;<a href="mailto:customercare@srl.in">customercare@srl.in</a></p><p>10.<strong>Tata Memorial Centre</strong>,</p><p>Advanced Centre for Treatment, Research and Education in Cancer</p><p>Kharghar, Navi Mumbai - 410 210, INDIA.</p><p>Tel: +91-22-2740 5000</p><p>Fax: +91-22-2740 5085</p><p>E-mail: mail@actrec.gov.in</p><p style="text-align: center;">&nbsp;</p><p style="text-align: center;"><span style="font-size: large;"><a href="mailto:office@actrec.gov.in"></a></span></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</guid>
	<pubDate>Fri, 07 Apr 2023 13:11:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</link>
	<title><![CDATA[Carrot2 clustering engine]]></title>
	<description><![CDATA[<h2>&nbsp;</h2>
<p>This is the demo application of the&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;clustering engine</a>. It uses Carrot<sup>2</sup>'s algorithms to organize search results into thematic folders.</p>
<h3>User interfaces</h3>
<ul>
<li><span><a href="https://search.carrot2.org/#/search/:source">Web Search Clustering</a></span>&nbsp;organizes search results from public search engines into clusters; offers treemap- and pie-chart visualizations of the clusters.</li>
<li><span><a href="https://search.carrot2.org/#/workbench">Clustering Workbench</a></span>&nbsp;clusters content from local files in JSON or Excel format, Solr or Elasticsearch; allows tuning of clustering parameters and exporting results as Excel or JSON.</li>
</ul>
<h3>Search engines</h3>
<ul>
<li><span>Web</span>:&nbsp;<span>web search results provided by&nbsp;<a href="https://etools.ch/" target="_blank">etools.ch</a>. Extensive use may require special arrangements with the&nbsp;<a href="mailto:sschmid@comcepta.com" target="_blank">owner</a>&nbsp;of the etools.ch service.</span></li>
<li><span>PubMed</span>:&nbsp;<span>abstracts of medical papers from the PubMed database provided by NCBI.</span></li>
<li><span>Local file</span>:&nbsp;<span>content read from a local file in Carrot2 XML, JSON, CSV or Excel format.</span></li>
<li><span>Solr</span>:&nbsp;<span>queries an Apache Solr instance.</span></li>
<li><span>Elasticsearch</span>:&nbsp;<span>queries an Elasticsearch instance.</span></li>
</ul>
<h3>Clustering algorithms</h3>
<ul>
<li><span>Lingo</span>:&nbsp;<span>creates well-described flat clusters. Does not scale beyond a few thousand search results. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a>.</span></li>
<li><span>STC</span>:&nbsp;<span>the classic search results clustering algorithm. Produces flat cluster with adequate description, very fast. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
<li><span>k-means</span>:&nbsp;<span>base line clustering algorithm, produces bag-of-words style cluster descriptions. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
</ul><p>Address of the bookmark: <a href="https://search.carrot2.org/#/search/web" rel="nofollow">https://search.carrot2.org/#/search/web</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27110/easyfig</guid>
	<pubDate>Fri, 29 Apr 2016 05:49:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27110/easyfig</link>
	<title><![CDATA[Easyfig]]></title>
	<description><![CDATA[<p>Easyfig has moved to github, for newer releases of Easyfig please visit our new webpage - https://mjsull.github.io/Easyfig.&nbsp; Easyfig is a Python application for creating linear comparison figures of multiple genomic loci with an easy-to-use graphical user interface (GUI).</p>
<p>More at http://easyfig.sourceforge.net/</p><p>Address of the bookmark: <a href="http://easyfig.sourceforge.net/" rel="nofollow">http://easyfig.sourceforge.net/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27331/andi</guid>
	<pubDate>Fri, 13 May 2016 05:16:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27331/andi</link>
	<title><![CDATA[Andi]]></title>
	<description><![CDATA[<p>This is the <code>andi</code> program for estimating the evolutionary distance between closely related genomes. These distances can be used to rapidly infer phylogenies for big sets of genomes. Because <code>andi</code> does not compute full alignments, it is so efficient that it scales even up to thousands of bacterial genomes.</p>
<p>This readme covers all necessary instructions for the impatient to get <code>andi</code> up and running. For extensive instructions please consult the <a href="https://github.com/EvolBioInf/andi/blob/master/andi-manual.pdf">manual</a>.</p>
<p>More at https://github.com/evolbioinf/andi/</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</guid>
	<pubDate>Sat, 21 May 2016 22:42:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</link>
	<title><![CDATA[Bpipe - a tool for running and managing bioinformatics pipelines]]></title>
	<description><![CDATA[<p>Bpipe provides a platform for running big bioinformatics jobs that consist of a series of processing stages - known as 'pipelines'.</p>
<ul>
<li>January 20th, 2016 - New! Bpipe 0.9.9 released!</li>
<li>Download <a href="http://download.bpipe.org/versions/bpipe-0.9.9.tar.gz">latest</a>, <a href="http://download.bpipe.org">all</a></li>
<li><a href="http://docs.bpipe.org">Documentation</a></li>
<li><a href="https://groups.google.com/forum/#%21forum/bpipe-discuss">Mailing List</a> (Google Group)</li>
</ul>
<p>Bpipe has been published in <a href="http://bioinformatics.oxfordjournals.org/content/early/2012/04/11/bioinformatics.bts167.abstract">Bioinformatics</a>! If you use Bpipe, please cite:</p>
<p><em>Sadedin S, Pope B &amp; Oshlack A, Bpipe: A Tool for Running and Managing Bioinformatics Pipelines, Bioinformatics</em></p><p>Address of the bookmark: <a href="http://docs.bpipe.org/" rel="nofollow">http://docs.bpipe.org/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>