<?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/38735?offset=300</link>
	<atom:link href="https://bioinformaticsonline.com/related/38735?offset=300" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44865/snp-analysis-unlocking-the-secrets-in-our-dna</guid>
	<pubDate>Wed, 16 Jul 2025 01:31:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44865/snp-analysis-unlocking-the-secrets-in-our-dna</link>
	<title><![CDATA[SNP Analysis: Unlocking the Secrets in Our DNA]]></title>
	<description><![CDATA[<p>Single Nucleotide Polymorphisms (SNPs) are the most common type of genetic variation in humans&mdash;and many other organisms. A single base change in the DNA sequence (for example, an A instead of a G) can influence everything from our eye color to our risk of developing diseases. Analyzing these tiny changes has become central to modern genetics, medicine, agriculture, and evolutionary biology.</p><p><strong>What are SNPs?</strong><br />SNPs (pronounced "snips") are positions in the genome where individuals differ by a single nucleotide. For example:</p><p>Reference: ...A T G C A T G A...<br />Variant:&nbsp; &nbsp; &nbsp;...A T G T A T G A...</p><p>Here, the C in the reference genome has been replaced by a T in the variant.</p><p>SNPs occur roughly every 300&ndash;1,000 bases in the human genome, meaning there are millions of them scattered throughout our DNA. Most SNPs have no effect on health, but some are linked to disease susceptibility, drug response, and other traits.</p><p><strong>Why Do We Analyze SNPs?</strong><br />1. Medical Genetics</p><p>Identify disease-associated variants (e.g., BRCA1/2 in breast cancer).</p><p>Predict drug response (pharmacogenomics).</p><p>Enable precision medicine by tailoring treatments.</p><p>2. Population Genetics &amp; Ancestry</p><p>Trace human migration and ancestry.</p><p>Study genetic diversity within and between populations.</p><p>3. Agriculture &amp; Animal Breeding</p><p>Select for desirable traits (drought resistance, yield, disease resistance).</p><p>Improve breeding efficiency in livestock.</p><p>4. Evolutionary Biology</p><p>Track natural selection.</p><p>Study adaptation in wild populations.</p><p><strong>How is SNP Analysis Performed?</strong><br />SNP analysis can be broadly divided into three steps:</p><p>SNP Detection<br />Genotyping arrays: Chips that test hundreds of thousands of known SNP positions simultaneously. Fast and affordable, widely used in consumer ancestry testing.</p><p>Whole-genome or whole-exome sequencing: Can detect known and novel SNPs across the genome.</p><p>Targeted sequencing or PCR: For focused analysis of specific regions.</p><p>Variant Calling<br />Sequencing data is aligned to a reference genome. Bioinformatics tools (e.g., GATK, bcftools) identify positions where the sequenced sample differs from the reference.</p><p>Annotation and Interpretation<br />Tools (e.g., SnpEff, VEP) predict the functional impact of SNPs.</p><p>Are the SNPs in coding regions? Do they cause amino acid changes? Are they known to be pathogenic?</p><p>Databases like dbSNP, ClinVar, and GWAS Catalog provide information on known associations.</p><p>Common Tools for SNP Analysis<br />Alignment: BWA, Bowtie2</p><p>Variant Calling: GATK, FreeBayes</p><p>Visualization: IGV, UCSC Genome Browser</p><p>Annotation: SnpEff, VEP</p><p>Statistical Analysis: PLINK, SNPTEST</p><p><strong>Challenges in SNP Analysis</strong><br />False positives/negatives: Sequencing errors, alignment issues.</p><p>Population stratification: Confounding in association studies.</p><p>Interpretation: Many SNPs have unknown or complex effects.</p><p>Researchers address these with rigorous quality control, large datasets, and increasingly sophisticated statistical models.</p><p><strong>The Future of SNP Analysis</strong><br />With advances in sequencing technology and AI-driven analysis, SNP studies are expanding:</p><p>Polygenic risk scores predict disease risk based on thousands of SNPs.</p><p>Large-scale biobanks (e.g., UK Biobank, All of Us) enable powerful genome-wide association studies (GWAS).</p><p>CRISPR and functional assays help validate SNP effects in the lab.</p><p>SNP analysis is at the heart of the genomic revolution, promising insights into biology, health, and evolution at unprecedented scale.</p><p><strong>Conclusion</strong><br />From diagnosing rare diseases to designing better crops, SNP analysis is a foundational tool in modern science. As our ability to sequence and interpret genomes improves, so will our understanding of these tiny&mdash;but mighty&mdash;variations in DNA.</p><p>&nbsp;</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34699/biological-file-format-tutorial</guid>
	<pubDate>Sun, 17 Dec 2017 18:13:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34699/biological-file-format-tutorial</link>
	<title><![CDATA[Biological file format tutorial]]></title>
	<description><![CDATA[<p>This section explains some of the commonly used file formats in bioinformatics. The information provided here is basic and designed to help users to distinguish the difference between different formats. Please refer user manual or other information resources on web for more details.</p>
<ol>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_fasta">FASTA</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_fastq">FASTQ</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_sam">SAM</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_bam">BAM</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_vcf">VCF</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_gff">GFF</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_gtf">GTF</a></li>
</ol><p>Address of the bookmark: <a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/" rel="nofollow">https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43631/pangolin-tutorial</guid>
	<pubDate>Fri, 10 Dec 2021 05:58:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43631/pangolin-tutorial</link>
	<title><![CDATA[Pangolin tutorial !]]></title>
	<description><![CDATA[<p><span>This is a tutorial for using the Pangolin Web Application. For information on using the command line tool, please visit the&nbsp;</span><a href="https://cov-lineages.org/resources/pangolin/usage.html">command line tool usage page</a><span>.</span></p>
<p>https://cov-lineages.org/resources/pangolin/tutorial.html</p><p>Address of the bookmark: <a href="https://cov-lineages.org/resources/pangolin/tutorial.html" rel="nofollow">https://cov-lineages.org/resources/pangolin/tutorial.html</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</guid>
	<pubDate>Wed, 21 Aug 2013 07:56:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</link>
	<title><![CDATA[Comparison of Short Read De Novo Alignment Algorithms]]></title>
	<description><![CDATA[<p>Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.</p>
<p>Title:&nbsp;<strong>Comparison of Short Read De Novo Alignment Algorithms&nbsp;</strong></p>
<p>Author<strong>: Nikhil Gopal</strong></p><p>Address of the bookmark: <a href="http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf" rel="nofollow">http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34931/3d-dna-3d-de-novo-assembly-3d-dna-pipeline</guid>
	<pubDate>Thu, 28 Dec 2017 10:09:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34931/3d-dna-3d-de-novo-assembly-3d-dna-pipeline</link>
	<title><![CDATA[3d-dna: 3D de novo assembly (3D DNA) pipeline]]></title>
	<description><![CDATA[<p>This code is designed to enable anyone to reproduce the Hs2-HiC and the AaegL4 genomes reported in:&nbsp;<a href="http://science.sciencemag.org/content/early/2017/03/22/science.aal3327.full">Dudchenko et al., De novo assembly of the Aedes aegypti genome using Hi-C yields chromosome-length scaffolds. Science, 2017.</a></p>
<p>Unless otherwise noted, all terminology below is consistent with this paper, and all references to figures and tables in this readme refer to this paper. Specifically, some of the terminology used below is outlined in&nbsp;<code>Figure S2</code>. The assembly procedure is described in detail in the&nbsp;<a href="http://science.sciencemag.org/content/suppl/2017/03/22/science.aal3327.DC1?_ga=1.9816115.760837492.1490574064">Supporting Online Materials</a>, specifically in the section labelled &ldquo;Pipeline description&rdquo;.</p>
<p>In addition, the pipeline uses tools and methods from&nbsp;<a href="http://www.cell.com/cell-systems/abstract/S2405-4712(16)30219-8">Juicer (Durand &amp; Shamim et al., Cell Systems, 2016)</a>&nbsp;and&nbsp;<a href="http://www.cell.com/cell-systems/abstract/S2405-4712(15)00054-X">Juicebox (Durand &amp; Robinson et al., Cell Systems, 2016)</a>, as well as additional dependencies noted below.</p>
<p>Feel free to post your questions and comments at:&nbsp;<a href="http://www.aidenlab.org/forum.html">http://www.aidenlab.org/forum.html</a></p>
<p>http://aidenlab.org/documentation.html</p><p>Address of the bookmark: <a href="https://github.com/theaidenlab/3d-dna" rel="nofollow">https://github.com/theaidenlab/3d-dna</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36865/perga-a-paired-end-read-guided-de-novo-assembler-for-extending-contigs-using-svm-and-look-ahead-approach</guid>
	<pubDate>Tue, 05 Jun 2018 09:57:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36865/perga-a-paired-end-read-guided-de-novo-assembler-for-extending-contigs-using-svm-and-look-ahead-approach</link>
	<title><![CDATA[PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM and Look Ahead Approach]]></title>
	<description><![CDATA[PERGA - Paired End Reads Guided Assembler

PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct contig, PERGA uses paired-end reads and different read overlap sizes from O ≥ Omax to Omin to resolve the gaps and branches. Moreover, by constructing a decision model using machine learning approach based on branch features, PERGA can determine the correct extension in 99.7% of cases. PERGA will try to extend the contigs by all feasible nucleotides and determine if these multiple extensions due to sequencing errors or repeats by using looking ahead technology, and it also try to separate the different repeats of nearby genomic regions to make the assembly result more longer and accurate.

The simulated E.coli paired-end reads data are generated using GemSim (KE McElroy, F Luciani, T Thomas. Gemsim: General, Error-Model Based Simulator of Next-Generation Sequencing Data. BMC Genomics 2012, 13:74), with coverage 50x, 60x, 100x, read lengths 100-bp, and can be downloaded from https://github.com/zhuxiao/data_PERGA.<p>Address of the bookmark: <a href="https://github.com/hitbio/PERGA" rel="nofollow">https://github.com/hitbio/PERGA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</guid>
	<pubDate>Tue, 03 Jul 2018 04:09:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</link>
	<title><![CDATA[ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly]]></title>
	<description><![CDATA[With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries.

Texas A&amp;M University researchers develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory.

Availability – A software program that implements the algorithm is available at: http://faculty.cse.tamu.edu/shsze/asplice.

Sze SH, Pimsler ML, Tomberlin JK, Jones CD, Tarone AM. (2017) A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms. BMC Genomics 18(Suppl 4):387.<p>Address of the bookmark: <a href="http://faculty.cse.tamu.edu/shsze/asplice/" rel="nofollow">http://faculty.cse.tamu.edu/shsze/asplice/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</guid>
	<pubDate>Wed, 14 Nov 2018 04:50:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</link>
	<title><![CDATA[MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph]]></title>
	<description><![CDATA[<p><span>MEGAHIT is a single node assembler for large and complex metagenomics NGS reads, such as soil. It makes use of succinct&nbsp;</span><em>de Bruijn</em><span>&nbsp;graph (SdBG) to achieve low memory assembly. MEGAHIT can&nbsp;</span><span>optionally</span><span>&nbsp;utilize a CUDA-enabled GPU to accelerate its SdBG contstruction. The GPU-accelerated version of MEGAHIT has been tested on NVIDIA GTX680 (4G memory) and Tesla K40c (12G memory) with CUDA 5.5, 6.0 and 6.5. MEGAHIT v1.0 or greater also supports IBM Power PC and has been tested on IBM POWER8.</span></p>
<p><span>https://academic.oup.com/bioinformatics/article/31/10/1674/177884</span></p><p>Address of the bookmark: <a href="https://github.com/voutcn/megahit" rel="nofollow">https://github.com/voutcn/megahit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</guid>
	<pubDate>Tue, 09 Jun 2020 05:21:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</link>
	<title><![CDATA[StringTie Transcript assembly and quantification for RNA-Seq]]></title>
	<description><![CDATA[<p><strong>StringTie</strong><span>&nbsp;is a fast and highly efficient assembler of RNA-Seq alignments into potential transcripts. It uses a novel network flow algorithm as well as an optional&nbsp;</span><em>de novo</em><span>&nbsp;assembly step to assemble and quantitate full-length transcripts representing multiple splice variants for each gene locus. Its input can include not only alignments of short reads that can also be used by other transcript assemblers, but also alignments of longer sequences that have been assembled from those reads. In order to identify differentially expressed genes between experiments, StringTie's output can be processed by specialized software like&nbsp;</span><a href="https://github.com/alyssafrazee/ballgown">Ballgown</a><span>,&nbsp;</span><a href="http://cole-trapnell-lab.github.io/cufflinks/cuffdiff/index.html">Cuffdiff</a><span>&nbsp;or other programs (DESeq2, edgeR, etc.).</span></p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/" rel="nofollow">https://ccb.jhu.edu/software/stringtie/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</guid>
	<pubDate>Sun, 02 Feb 2020 13:41:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</link>
	<title><![CDATA[3D de novo assembly (3D DNA) pipeline]]></title>
	<description><![CDATA[<p>For a detailed description of the pipeline and how it integrates with other tools designed by the Aiden Lab see&nbsp;<a href="http://aidenlab.org/assembly/manual_180322.pdf">Genome Assembly Cookbook</a>&nbsp;on&nbsp;<a href="http://aidenlab.org/assembly">http://aidenlab.org/assembly</a>.</p>
<p>For the original version of the pipeline and to reproduce the Hs2-HiC and the AaegL4 genomes reported in&nbsp;<a href="http://science.sciencemag.org/content/356/6333/92">(Dudchenko et al.,&nbsp;<em>Science</em>, 2017)</a>&nbsp;see the&nbsp;<a href="https://github.com/theaidenlab/3d-dna/tree/745779bdf64db6e55bddb70c24e9b58825938c33">original commit</a>.</p>
<p>For the detailed description of the merge section see&nbsp;<a href="https://github.com/theaidenlab/AGWG-merge">https://github.com/theaidenlab/AGWG-merge</a>.</p><p>Address of the bookmark: <a href="https://github.com/theaidenlab/3d-dna" rel="nofollow">https://github.com/theaidenlab/3d-dna</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>