<?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/42310?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/42310?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37993/platypus-a-haplotype-based-variant-caller-for-next-generation-sequence-data</guid>
	<pubDate>Thu, 25 Oct 2018 06:14:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37993/platypus-a-haplotype-based-variant-caller-for-next-generation-sequence-data</link>
	<title><![CDATA[Platypus: A Haplotype-Based Variant Caller For Next Generation Sequence Data]]></title>
	<description><![CDATA[<p><strong>Platypus</strong><span>&nbsp;is a tool designed for efficient and accurate variant-detection in high-throughput sequencing data. By using local realignment of reads and local assembly it achieves both high sensitivity and high specificity. Platypus can detect SNPs, MNPs, short indels, replacements and (using the assembly option) deletions up to several kb. It has been extensively tested on&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/?term=24463883">whole-genome</a><span>,&nbsp;</span><a href="http://www.nature.com/ng/journal/v45/n1/abs/ng.2492.html">exon-capture</a><span>, and&nbsp;</span><a href="http://www.nature.com/nature/journal/v493/n7432/abs/nature11725.html">targeted capture</a><span>&nbsp;data, it has been run on very large datasets as part of the&nbsp;</span><a href="http://www.1000genomes.org/">Thousand Genomes</a><span>&nbsp;and WGS500 projects, and is being used in clinical sequencing trials in the&nbsp;</span><a href="http://www.mcgprogramme.com/">Mainstreaming Cancer Genetics</a><span>&nbsp;programme.&nbsp;</span></p>
<p><span>Tutorial&nbsp;https://github.com/andyrimmer/Platypus/blob/master/misc/README.txt</span></p><p>Address of the bookmark: <a href="http://www.well.ox.ac.uk/platypus" rel="nofollow">http://www.well.ox.ac.uk/platypus</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39875/lrsday-long-read-sequencing-data-analysis-for-yeasts</guid>
	<pubDate>Mon, 26 Aug 2019 18:07:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39875/lrsday-long-read-sequencing-data-analysis-for-yeasts</link>
	<title><![CDATA[LRSDAY: Long-read Sequencing Data Analysis for Yeasts]]></title>
	<description><![CDATA[<p><span>Long-read sequencing technologies have become increasingly popular in genome projects due to their strengths in resolving complex genomic regions. As a leading model organism with small genome size and great biotechnological importance, the budding yeast,&nbsp;</span><em>Saccharomyces cerevisiae</em><span>, has many isolates currently being sequenced with long reads.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/yjx1217/LRSDAY" rel="nofollow">https://github.com/yjx1217/LRSDAY</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/42324/comparative-genomics-data-set-including-240-mammals-released</guid>
	<pubDate>Thu, 19 Nov 2020 06:45:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42324/comparative-genomics-data-set-including-240-mammals-released</link>
	<title><![CDATA[Comparative Genomics Data Set Including 240 Mammals Released !]]></title>
	<description><![CDATA[<p>The genome of 130 mammals was sequenced by a large international consortium and the data was analyzed together with 110 existing genomes to allow scientists to identify the important positions in the DNA. This report, published in Nature today will help advance research on human disease mutations and inform how best to protect endangered species.</p><p>In addition to the knowledge of the human genome, all these genomes, widely sampled across mammals, can be used to research how particular organisms respond to different conditions. Some otters, for example, have a thick, water-resistant shell, and some rodents, but not all, have adapted to hibernation. These animal traits will help us to understand human traits, such as metabolic diseases.</p><p><img src="https://media.springernature.com/lw685/springer-static/image/art%3A10.1038%2Fs41586-020-2876-6/MediaObjects/41586_2020_2876_Fig1_HTML.png?as=webp" alt="image" style="border: 0px; border: 0px;"></p><p>With climate change and more animal ecosystems being threatened by human activity, the protection of endangered species is becoming increasingly important. Scientists have historically researched several people in various populations of a species to understand the genetic variation that occurs in that species. This is important for understanding how particular species can be protected. In this study, animals on the Red List of Endangered Species of the International Union for Conservation of Nature had fewer differences in their genomes, which is consistent with their endangered status.</p><p>Ref @&nbsp;A comparative genomics multitool for scientific discovery and conservation&nbsp;https://www.nature.com/articles/s41586-020-2876-6</p><p>&nbsp;Data at&nbsp;http://zoonomiaproject.org/</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44545/amr-database</guid>
	<pubDate>Tue, 04 Jun 2024 13:37:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44545/amr-database</link>
	<title><![CDATA[AMR Database !]]></title>
	<description><![CDATA[<ul>
<li><a href="http://en.mediterranee-infection.com/article.php?laref=283%26titre=arg-annot">ARG-ANNOT</a>. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24145532">24145532</a></li>
<li><a href="https://card.mcmaster.ca/">CARD</a>. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/23650175">23650175</a></li>
<li><a href="https://megares.meglab.org/">MEGARes</a>&nbsp;PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/27899569">27899569</a></li>
<li><a href="https://www.ncbi.nlm.nih.gov/pathogens/isolates#/refgene/">NCBI</a>&nbsp;BioProject:&nbsp;<a href="https://www.ncbi.nlm.nih.gov/bioproject/?term=PRJNA313047">PRJNA313047</a></li>
<li><a href="https://cge.cbs.dtu.dk/services/PlasmidFinder/">plasmidfinder</a>&nbsp;PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24777092">24777092</a></li>
<li><a href="https://cge.cbs.dtu.dk//services/ResFinder/">resfinder</a>. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/22782487">22782487</a></li>
<li><a href="http://www.mgc.ac.cn/VFs/">VFDB</a>. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26578559">26578559</a></li>
<li><a href="https://github.com/katholt/srst2">SRST2</a>'s version of ARG-ANNOT. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/25422674">25422674</a>.</li>
<li><a href="https://cge.cbs.dtu.dk/services/VirulenceFinder/">VirulenceFinder</a>&nbsp;PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24574290">24574290</a>.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/sanger-pathogens/ariba/wiki/Task%3A-getref" rel="nofollow">https://github.com/sanger-pathogens/ariba/wiki/Task%3A-getref</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44852/what-is-data-science-%E2%80%94-a-bioinformatics-perspective</guid>
	<pubDate>Mon, 16 Jun 2025 01:44:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44852/what-is-data-science-%E2%80%94-a-bioinformatics-perspective</link>
	<title><![CDATA[What is Data Science? — A Bioinformatics Perspective]]></title>
	<description><![CDATA[<p>In today&rsquo;s era of big biology, we&rsquo;re generating more data than ever before&mdash;genomes, transcriptomes, proteomes, metabolomes, microbiomes&hellip; you name it. But raw biological data doesn&rsquo;t speak for itself. Making sense of it requires more than traditional biology. This is where data science steps in.</p><p><strong>So, What Is Data Science?</strong><br />At its core, data science is the interdisciplinary field that extracts knowledge and insights from data using programming, statistics, and domain expertise. In bioinformatics, data science enables us to turn gigabytes of sequence data into biological meaning.</p><p>Imagine trying to understand gene regulation in cancer by analyzing thousands of RNA-seq samples, or predicting antibiotic resistance from bacterial genomes&mdash;these challenges are not solvable through wet lab experiments alone. They require data-driven thinking.</p><p><strong>Data Science Meets Bioinformatics</strong><br />Bioinformatics is inherently a data science domain. From genomics to systems biology, every field in modern biology relies on data science techniques to:</p><p>Clean and process massive datasets</p><p>Discover patterns in high-dimensional data</p><p>Build predictive models (e.g., for disease classification)</p><p>Visualize complex biological networks and trends</p><p>Integrate diverse data types (e.g., transcriptomic + epigenomic data)</p><p><strong>The Bioinformatics Toolkit</strong><br />Here&rsquo;s what data science typically looks like in bioinformatics:</p><p>Task Data Science Role<br />Sequence alignment Efficient algorithms, indexing, parallel processing<br />Gene expression analysis Statistical modeling (e.g., DESeq2, limma)<br />Variant calling Data filtering, probabilistic models<br />Clustering of cells in single-cell data Unsupervised learning<br />Protein structure prediction Deep learning models (e.g., AlphaFold)<br />Metagenomics Data integration, classification, dimensionality reduction</p><p>Common tools include Python, R, Bioconductor, scikit-learn, Pandas, Seurat, and TensorFlow&mdash;often working together in reproducible workflows.</p><p><strong>It's Not Just About Coding</strong><br />A common misconception is that bioinformatics is just programming or scripting. But being a data scientist in bioinformatics also means:</p><p>Understanding experimental design</p><p>Asking biologically meaningful questions</p><p>Choosing the right statistical or machine learning models</p><p>Communicating findings effectively (e.g., plots, dashboards, papers)</p><p>In other words, data science in bioinformatics is where biology, statistics, and computer science converge.</p><p><strong>Why It Matters</strong><br />The real power of data science in bioinformatics is its ability to scale discovery.</p><p>Instead of studying one gene, we can study thousands.</p><p>Instead of analyzing one species, we can explore entire ecosystems.</p><p>Instead of waiting months for lab results, we can generate hypotheses in days.</p><p>From personalized medicine and cancer diagnostics to agricultural genomics and pandemic surveillance, data science is at the heart of the bioinformatics revolution.</p><p><strong>Final Thoughts</strong><br />If you&rsquo;re a biologist who&rsquo;s curious about code, or a data enthusiast fascinated by life sciences, bioinformatics is your playground&mdash;and data science is your toolkit.</p><p>In bioinformatics, data science isn&rsquo;t just useful. It&rsquo;s essential.</p><p>&nbsp;</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</guid>
	<pubDate>Fri, 08 Dec 2017 14:41:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</link>
	<title><![CDATA[FOGSAA: Fast Optimal Global Sequence Alignment Algorithm]]></title>
	<description><![CDATA[<p>Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.</p><p>Address of the bookmark: <a href="http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm" rel="nofollow">http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm</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/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</guid>
	<pubDate>Tue, 15 May 2018 04:44:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</link>
	<title><![CDATA[LAMSA: fast split read alignment with long approximate matches]]></title>
	<description><![CDATA[LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs).

LAMSA takes takes the advantage of the rareness of SVs to implement a specifically designed two-step strategy. That is, LAMSA initially splits the read into relatively long fragments and co-linearly align them to solve the small variations or sequencing errors, and mitigate the effect of repeats. The alignments of the fragments are then used for implementing a sparse dynamic programming (SDP)-based split alignment approach to handle the large or non-co-linear variants.

We benchmarked LAMSA with simulated and real datasets having various read lengths and sequencing error rates, the results demonstrate that it is substantially faster than the state-of-the-art long read aligners; mean-while, it also has good ability to handle various categories of SVs.

LAMSA is open source and free for non-commercial use.

LAMSA is mainly designed by Bo Liu &amp; Yan Gao and developed by Yan Gao in Center for Bioinformatics, Harbin Institute of Technology, China.<p>Address of the bookmark: <a href="https://github.com/hitbc/LAMSA" rel="nofollow">https://github.com/hitbc/LAMSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37602/indexcov-fast-coverage-quality-control-for-whole-genome-sequencing</guid>
	<pubDate>Wed, 29 Aug 2018 09:20:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37602/indexcov-fast-coverage-quality-control-for-whole-genome-sequencing</link>
	<title><![CDATA[Indexcov: fast coverage quality control for whole-genome sequencing]]></title>
	<description><![CDATA[<p><em>indexcov</em><span>, an efficient estimator of whole-genome sequencing coverage to rapidly identify samples with aberrant coverage profiles, reveal large-scale chromosomal anomalies, recognize potential batch effects, and infer the sex of a sample.&nbsp;</span><em>Indexcov</em><span>&nbsp;is available at&nbsp;</span><a href="https://github.com/brentp/goleft" target="_blank">https://github.com/brentp/goleft</a><span>&nbsp;under the MIT license.</span></p><p>Address of the bookmark: <a href="https://github.com/brentp/goleft" rel="nofollow">https://github.com/brentp/goleft</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39640/flas-fast-and-high-throughput-algorithm-for-pacbio-long-read-self-correction</guid>
	<pubDate>Sat, 22 Jun 2019 12:16:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39640/flas-fast-and-high-throughput-algorithm-for-pacbio-long-read-self-correction</link>
	<title><![CDATA[FLAS: fast and high throughput algorithm for PacBio long read self-correction.]]></title>
	<description><![CDATA[<p><span>FLAS, a wrapper algorithm of MECAT, to achieve high throughput long read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes misalignments for accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/baoe/flas" rel="nofollow">https://github.com/baoe/flas</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>