<?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/34867?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/related/34867?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</guid>
	<pubDate>Tue, 07 Nov 2017 05:33:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</link>
	<title><![CDATA[Alignment-free sequence comparison tools available for next-generation sequencing data analysis]]></title>
	<description><![CDATA[<div><p><span>kallisto</span></p></div><div><p>Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)</p><p>Software (C++)</p><p><a href="https://pachterlab.github.io/kallisto/">https://pachterlab.github.io/kallisto/</a></p><p>Sailfish</p><p>Estimation of isoform abundances from reference sequences and RNA-seq data (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="http://www.cs.cmu.edu/~ckingsf/software/sailfish/">http://www.cs.cmu.edu/~ckingsf/software/sailfish/</a></p><p>Salmon</p><p>Quantification of the expression of transcripts using RNA-seq data (uses&nbsp;<em>k</em>-mers)</p><p><a href="https://combine-lab.github.io/salmon/">https://combine-lab.github.io/salmon/</a></p><p>RNA-Skim</p><p>RNA-seq quantification at transcript-level (partitions the transcriptome into disjoint transcript clusters; uses&nbsp;<em>sig</em>-mers, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C++)</p><p><a href="http://www.csbio.unc.edu/rs/">http://www.csbio.unc.edu/rs/</a></p><p>Variant calling</p><p>ChimeRScope</p><p>Fusion transcript prediction using gene&nbsp;<em>k</em>-mers profiles of the RNA-seq paired-end reads</p><p>Software (Java)</p><p><a href="https://github.com/ChimeRScope/ChimeRScope/wiki">https://github.com/ChimeRScope/ChimeRScope/wiki</a></p><p>FastGT</p><p>Genotyping of known SNV/SNP variants directly from raw NGS sequence reads by counting unique&nbsp;<em>k</em>-mers</p><p>Software (C)</p><p><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></p><p>Phy-Mer</p><p>Reference-independent mitochondrial haplogroup classifier from NGS data (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/danielnavarrogomez/phy-mer">https://github.com/danielnavarrogomez/phy-mer</a></p><p>LAVA</p><p>Genotyping of known SNPs (dbSNP and Affymetrix's Genome-Wide Human SNP Array) from raw NGS reads (<em>k</em>-mer based)</p><p>Software (C)</p><p><a href="http://lava.csail.mit.edu/">http://lava.csail.mit.edu/</a></p><p>MICADo</p><p>Detection of mutations in targeted third-generation NGS data (can distinguish patients&rsquo; specific mutations; algorithm uses&nbsp;<em>k</em>-mers and is based on colored de Bruijn graphs)</p><p>Software (Python)</p><p><a href="http://github.com/cbib/MICADo">http://github.com/cbib/MICADo</a></p><p>General mapper</p><p>Minimap</p><p>Lightweight and fast read mapper and read overlap detector (uses the concept of &ldquo;minimazers&rdquo;, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C)</p><p><a href="https://github.com/lh3/minimap">https://github.com/lh3/minimap</a></p><p>Assembly</p><p>De novo genome assembly</p><p>MHAP</p><p>Produces highly continuous assembly (fully resolved chromosome arms) from third-generation long and noisy reads (10 kbp) using a dimensionality reduction technique MinHash</p><p>Software (Java)</p><p><a href="https://github.com/marbl/MHAP">https://github.com/marbl/MHAP</a></p><p>Miniasm</p><p>Assembler of long noisy reads (SMRT, ONT) using the Overlap-Layout Consensus (OLC) approach without the necessity of an error correction stage (uses minimap)</p><p>Software (C)</p><p><a href="https://github.com/lh3/miniasm">https://github.com/lh3/miniasm</a></p><p>LINKS</p><p>Scaffolding genome assembly with error-containing long sequence (e.g., ONT or PacBio reads, draft genomes)</p><p>Software (Perl)</p><p><a href="https://github.com/warrenlr/LINKS/">https://github.com/warrenlr/LINKS/</a></p><p>Read clustering</p><p>afcluster</p><p>Clustering of reads from different genes and different species based on&nbsp;<em>k</em>-mer counts</p><p>Software (C++)</p><p><a href="https://github.com/luscinius/afcluster">https://github.com/luscinius/afcluster</a></p><p>QCluster</p><p>Clustering of reads with alignment-free measures (<em>k</em>-mer based) and quality values</p><p>Software (C++)</p><p><a href="http://www.dei.unipd.it/~ciompin/main/qcluster.html">http://www.dei.unipd.it/~ciompin/main/qcluster.html</a></p><p>Reads error correction</p><p>Lighter</p><p>Correction of sequencing errors in raw, whole genome sequencing reads (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="https://github.com/mourisl/Lighter">https://github.com/mourisl/Lighter</a></p><p>QuorUM</p><p>Error corrector for Illumina reads using k-mers</p><p>Software (C++)</p><p><a href="https://github.com/gmarcais/Quorum">https://github.com/gmarcais/Quorum</a></p><p>Trowel</p><p>Software (C++)</p><p><a href="https://sourceforge.net/projects/trowel-ec/">https://sourceforge.net/projects/trowel-ec/</a></p><p>Metagenomics</p><p>Assembly-free phylogenomics</p><p>AAF</p><p>Phylogeny reconstruction directly from unassembled raw sequence data from whole genome sequencing projects; provides bootstrap support to assess uncertainty in the tree topology (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/fanhuan/AAF">https://github.com/fanhuan/AAF</a></p><p>kSNP v3</p><p>Reference-free SNP identification and estimation of phylogenetic trees using SNPs (based on&nbsp;<em>k</em>-mer analysis)</p><p>Software (C)</p><p><a href="https://sourceforge.net/projects/ksnp/files/">https://sourceforge.net/projects/ksnp/files/</a></p><p>NGS-MC</p><p>Phylogeny of species based on NGS reads using alignment-free sequence dissimilarity measures d2* and d2&nbsp;S&nbsp;under different Markov chain models (using&nbsp;<em>k</em>-words)</p><p>R package</p><p><a href="http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html">http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html</a></p><p>Species identification/taxonomic profiling</p><p>CLARK</p><p>Taxonomic classification of metagenomic reads to known bacterial genomes using&nbsp;<em>k</em>-mer search and LCA assignment</p><p>Software (C++)</p><p><a href="http://clark.cs.ucr.edu/">http://clark.cs.ucr.edu/</a></p><p>FOCUS</p><p>Reports organisms present in metagenomic samples and profiles their abundances (uses composition-based approach and non-negative least squares for prediction)</p><p>Web service Software (Python)</p><p><a href="http://edwards.sdsu.edu/FOCUS/">http://edwards.sdsu.edu/FOCUS/</a></p><p>GSM</p><p>Estimation of abundances of microbial genomes in metagenomic samples (<em>k</em>-mer based)</p><p>Software (Go)</p><p><a href="https://github.com/pdtrang/GSM">https://github.com/pdtrang/GSM</a></p><p>Mash</p><p>Species identification using assembled or unassembled Illumina, PacBio, and ONT data (based on MinHash dimensionality-reduction technique)</p><p>Software (C++)</p><p><a href="https://github.com/marbl/mash">https://github.com/marbl/mash</a></p><p>Kraken</p><p>Taxonomic assignment in metagenome analysis by exact&nbsp;<em>k</em>-mer search; LCA assignment of short reads based on a comprehensive sequence database</p><p>Software (C++)</p><p><a href="https://ccb.jhu.edu/software/kraken/">https://ccb.jhu.edu/software/kraken/</a></p><p>LMAT</p><p>Assignment of taxonomic labels to reads by&nbsp;<em>k</em>-mers searches in precomputed database</p><p>Software (C++/Python)</p><p><a href="https://sourceforge.net/projects/lmat/">https://sourceforge.net/projects/lmat/</a></p><p>stringMLST</p><p><em>k</em>-mer-based tool for MLST directly from the genome sequencing reads</p><p>Software (Python)</p><p><a href="http://jordan.biology.gatech.edu/page/software/stringMLST">http://jordan.biology.gatech.edu/page/software/stringMLST</a></p><p>Taxonomer</p><p><em>k</em>-mer-based ultrafast metagenomics tool for assigning taxonomy to sequencing reads from clinical and environmental samples</p><p>Web service</p><p><a href="http://taxonomer.iobio.io/">http://taxonomer.iobio.io/</a></p><p>Other</p><p>d2-tools</p><p>Word-based (<em>k</em>-tuple) comparison (pairwise dissimilarity matrix using d2S measure) of metatranscriptomic samples from NGS reads</p><p>Software (Python/R)</p><p><a href="https://code.google.com/p/d2-tools/">https://code.google.com/p/d2-tools/</a></p><p>VirHostMatcher</p><p>Prediction of hosts from metagenomic viral sequences based on ONF using various distance measures (e.g., d2)</p><p>Software (C++)</p><p><a href="https://github.com/jessieren/VirHostMatcher">https://github.com/jessieren/VirHostMatcher</a></p><p>MetaFast</p><p>Statistics calculation of metagenome sequences and the distances between them based on assembly using de Bruijn graphs and Bray&ndash;Curtis dissimilarity measure</p><p>Software (Java)</p><p><a href="https://github.com/ctlab/metafast">https://github.com/ctlab/metafast</a></p></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41046/iseqqc-a-tool-for-expression-based-quality-control-in-rna-sequencing</guid>
	<pubDate>Sun, 16 Feb 2020 08:47:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41046/iseqqc-a-tool-for-expression-based-quality-control-in-rna-sequencing</link>
	<title><![CDATA[iSeqQC: a tool for expression-based quality control in RNA sequencing]]></title>
	<description><![CDATA[<p><span>iSeqQC, an expression-based QC tool that detects outliers either produced due to variable laboratory conditions or due to dissimilarity within a phenotypic group. iSeqQC implements various statistical approaches including unsupervised clustering, agglomerative hierarchical clustering and correlation coefficients to provide insight into outliers.</span></p>
<p><a href="http://cancerwebpa.jefferson.edu/iSeqQC/">http://cancerwebpa.jefferson.edu/iSeqQC/</a></p>
<p><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3399-8">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3399-8</a></p><p>Address of the bookmark: <a href="https://github.com/gkumar09/iSeqQC" rel="nofollow">https://github.com/gkumar09/iSeqQC</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/2423/cancers-origins-revealed</guid>
	<pubDate>Thu, 15 Aug 2013 13:06:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/2423/cancers-origins-revealed</link>
	<title><![CDATA[Cancer's origins revealed]]></title>
	<description><![CDATA[<p>Researchers have provided the first comprehensive compendium of mutational processes that drive tumour development. Together, these mutational processes explain most mutations found in 30 of the most common cancer types. This new understanding of cancer development could help to treat and prevent a wide-range of cancers.<br /><br />More at &gt;&gt; http://www.sanger.ac.uk/about/press/2013/130814.html</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4762/how-dna-is-packaged-advanced</guid>
	<pubDate>Mon, 23 Sep 2013 18:08:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4762/how-dna-is-packaged-advanced</link>
	<title><![CDATA[How DNA is Packaged (Advanced)]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/gbSIBhFwQ4s" frameborder="0" allowfullscreen></iframe>Each chromosome consists of one continuous thread-like molecule of DNA coiled tightly around proteins, and contains a portion of the 6,400,000,000 basepairs (DNA building blocks) that make up your DNA. 
Originally created for DNA Interactive ( http://www.dnai.org ).
TRANSCRIPT: In this animation we'll see the remarkable way our DNA is tightly packed up to fit into the nucleus of every cell. The process starts with assembly of a nucleosome, which is formed when eight separate histone protein subunits attach to the DNA molecule. The combined tight loop of DNA and protein is the nucleosome. Six nucleosomes are coiled together and these then stack on top of each other. The end result is a fiber of packed nucleosomes known as chromatin. This structure, is then looped and further packaged using other proteins (which are not shown here) to give the final "chromosomal" shapes. It is this remarkable multiple folding which allows six feet of DNA to fit into the nucleus of each cell in our body. And a typical cell nucleus is so small that ten thousand could fit on the tip of a needle. It is important to realize that chromosomes are not always present, they form only when cells are dividing. At other times, as we can see here at the end of cell division, our DNA becomes less highly organized.)]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</guid>
	<pubDate>Tue, 16 Mar 2021 05:45:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</link>
	<title><![CDATA[Nucl2Vec: Local alignment of DNA sequences using Distributed Vector Representation]]></title>
	<description><![CDATA[<p><span>We demonstrate a novel approach for</span><span>local alignment of DNA reads with respect to reference genome.</span><span>For this process we have used Skip-gram model for creating</span><span>encoding(Nucl2Vec) and k-nearest neighbor for the alignment.</span><span>With our new approach we have reduced computation cost for</span><span>local alignment , while achieving accuracy comparable to existing</span><span>defacto standard BWA-MEM tool.</span> </p>
<p><em>https://prakharg24.github.io/papers/401851.full.pdf</em></p><p>Address of the bookmark: <a href="https://prakharg24.github.io/papers/401851.full.pdf" rel="nofollow">https://prakharg24.github.io/papers/401851.full.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/20585/dna-transcription-advanced</guid>
	<pubDate>Thu, 29 Jan 2015 05:31:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/20585/dna-transcription-advanced</link>
	<title><![CDATA[DNA Transcription (Advanced)]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/SMtWvDbfHLo" frameborder="0" allowfullscreen></iframe><p>Transcription is the process by which the information in DNA is copied into messenger RNA (mRNA) for protein production. Originally created for DNA Interactive ( http://www.dnai.org ). TRANSCRIPT: The Central Dogma of Molecular Biology: "DNA makes RNA makes protein" Here the process begins. Transcription factors assemble at a specific promoter region along the DNA. The length of DNA following the promoter is a gene and it contains the recipe for a protein. A mediator protein complex arrives carrying the enzyme RNA polymerase. It manoeuvres the RNA polymerase into place... inserting it with the help of other factors between the strands of the DNA double helix. The assembled collection of all these factors is referred to as the transcription initiation complex... and now it is ready to be activated. The initiation complex requires contact with activator proteins, which bind to specific sequences of DNA known as enhancer regions. These regions may be thousands of base pairs distant from the start of the gene. Contact between the activator proteins and the initiation-complex releases the copying mechanism. The RNA polymerase unzips a small portion of the DNA helix exposing the bases on each strand. Only one of the strands is copied. It acts as a template for the synthesis of an RNA molecule which is assembled one sub-unit at a time by matching the DNA letter code on the template strand. The sub-units can be seen here entering the enzyme through its intake hole and they are joined together to form the long messenger RNA chain snaking out of the top.</p>]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32376/diamond</guid>
	<pubDate>Thu, 27 Apr 2017 04:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32376/diamond</link>
	<title><![CDATA[DIAMOND]]></title>
	<description><![CDATA[<p><span>DIAMOND is a sequence aligner for protein and translated DNA searches and functions as a drop-in replacement for the NCBI BLAST software tools. It is suitable for protein-protein search as well as DNA-protein search on short reads and longer sequences including contigs and assemblies, providing a speedup of BLAST ranging up to x20,000.</span></p>
<p><span>More at&nbsp;file:///home/urbe/Downloads/diamond_manual.pdf</span></p>
<p><span>http://www.nature.com/nmeth/journal/v12/n1/full/nmeth.3176.html</span></p><p>Address of the bookmark: <a href="https://github.com/bbuchfink/diamond" rel="nofollow">https://github.com/bbuchfink/diamond</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/33874/dna-testing-companies-around-the-globe</guid>
	<pubDate>Thu, 13 Jul 2017 04:44:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/33874/dna-testing-companies-around-the-globe</link>
	<title><![CDATA[DNA testing companies around the globe !]]></title>
	<description><![CDATA[<p>It was realized in the 1940s that DNA molecules are passed down through the generations of a family. In 1953 Watson and Crick elucidated the chemical structure of this molecule as a twisted ladder (a &lsquo;helix&rsquo;) made of two strands. DNA occurs in all the cells of our body, it is our blueprint! The strands of DNA contain information in the form of a code, which in turn determines our individual traits and characteristics. This code, the genetic code, is the order of four types of DNA building block. When the two strands of DNA separate, each building block (&lsquo;base&rsquo;) accurately templates a corresponding base on the newly made strand of DNA so that information is not lost but is instead duplicated and preserved.</p><p>Testing for similarities between DNA (deoxyribonucleic acid) samples from two people allows family relationships to be established &ndash; or disproved &ndash; to an extraordinarily high degree of certainty. A common use for a DNA test is to establish if a man is the biological father of a child; this is known as a paternity test. However, there are other uses for the science of DNA testing (also called genotyping), these include forensic analysis of human DNA samples, and tracking relationships amongst domesticated animals.</p><p>The order in which the bases occur in DNA is referred to as the DNA sequence. Each person is unique and just as people differ in their fingerprints, they also have a unique and slightly different DNA sequence. Half of a person&rsquo;s DNA is received from their mother, and half is received from the father. However, while fingerprints have no value for establishing family relationships, the minor variations in DNA sequence are extraordinarily useful for this purpose. All cells of our body contain DNA, skin cells from the lining of the cheek provide a simple and convenient source of material.</p><p>DNA is purified from these cells and the minor variations are read out as a type of bar-code by a machine. When the net DNA &lsquo;barcodes&rsquo; from family members are lined up next to each other it becomes clear when a child is related to biological parents because half the stripes in the bar-code like signature will line up with those of the mother, and half will line up with those of the father. On the other hand, in the absence of a biological relationship, the DNA signatures from a child and from a potential parent are not found to have 50% in common. It may be appreciated that DNA testing is the most convenient and scientifically accurate method of determining relationships between people.</p><p>Following are the list of companies who qssist in DNA testing:</p><h2><span>DNA testing companies</span></h2><ul>
<li><a href="https://isogg.org/wiki/23andMe" title="23andMe">23andMe</a>&nbsp;(admixture, adoption, deep ancestry, genealogy) (health and trait reports also available in some countries)</li>
<li><a href="https://24genetics.com/">24 genetics</a>&nbsp;(admixture, exome sequencing, health, paternity, pharmacogenetics, whole genome sequencing) A company catering for the Spanish market</li>
<li><a href="http://www.africanancestry.com/">African Ancestry</a>&nbsp;(deep ancestry)</li>
<li><a href="http://www.africandna.com/">AfricanDNA</a>&nbsp;(<a href="https://isogg.org/wiki/Family_Tree_DNA" title="Family Tree DNA">FTDNA</a>&nbsp;affiliate) (admixture, deep ancestry, genealogy)</li>
<li><a href="https://isogg.org/wiki/AncestrybyDNA" title="AncestrybyDNA">AncestrybyDNA</a>&nbsp;(admixture, deep ancestry)</li>
<li><a href="https://isogg.org/wiki/AncestryDNA" title="AncestryDNA">AncestryDNA</a>, a subsidiary of Ancestry.com (admixture, adoption, genealogy)</li>
<li><a href="https://atlas.ru/">Atlas Biomed</a>&nbsp;(deep ancestry, diet, health and traits, sport) A test catering for the Russian market</li>
<li><a href="https://isogg.org/wiki/BritainsDNA" title="BritainsDNA">BritainsDNA</a>&nbsp;(formerly Ethnoancestry) (admixture, deep ancestry)</li>
<li><a href="https://isogg.org/wiki/Centrillion_Biosciences" title="Centrillion Biosciences">Centrillion Biosciences</a>&nbsp;(aka TribeCode) (admixture, deep ancestry)</li>
<li>CymruDNAWales - see&nbsp;<a href="https://isogg.org/wiki/BritainsDNA" title="BritainsDNA">BritainsDNA</a></li>
<li><a href="https://www.dantelabs.com/">Dante Labs</a>&nbsp;(exome sequencing, health, whole genome sequencing) A test aimed at the European market</li>
<li><a href="http://www.dnaancestry.ae/">DNA Ancestry and Family Origin</a>&nbsp;(<a href="https://isogg.org/wiki/Family_Tree_DNA" title="Family Tree DNA">FTDNA</a>&nbsp;affiliate in the Middle East) (admixture, adoption, deep ancestry, full mtDNA sequencing, genealogy)</li>
<li><a href="http://dnaconsultants.com/">DNA Consultants</a>&nbsp;(admixture, deep ancestry)</li>
<li><a href="https://isogg.org/wiki/DNA_Tribes" title="DNA Tribes">DNA Tribes</a>&nbsp;(admixture)</li>
<li><a href="https://www.dna-worldwide.com/">DNA Worldwide</a>&nbsp;(formerly a&nbsp;<a href="https://isogg.org/wiki/Family_Tree_DNA" title="Family Tree DNA">FTDNA partner</a>. See also&nbsp;<a href="https://www.livingdna.com/">Living DNA</a>)</li>
<li>Ethnoancestry - see&nbsp;<a href="https://isogg.org/wiki/BritainsDNA" title="BritainsDNA">BritainsDNA</a></li>
<li><a href="https://isogg.org/wiki/Family_Tree_DNA" title="Family Tree DNA">Family Tree DNA</a>&nbsp;(admixture, adoption, deep ancestry, full mtDNA sequencing, genealogy, Y chromosome sequencing)</li>
<li><a href="https://isogg.org/wiki/Full_Genomes_Corporation" title="Full Genomes Corporation">Full Genomes Corporation</a>&nbsp;(whole genome sequencing, Y-chromosome sequencing)</li>
<li><a href="https://isogg.org/wiki/Gene_by_Gene" title="Gene by Gene">Gene by Gene</a>&nbsp;- the parent company of&nbsp;<a href="https://isogg.org/wiki/Family_Tree_DNA" title="Family Tree DNA">Family Tree DNA</a>&nbsp;which now incorporates the companies previously known as DNA Traits, DNA DTC and DNA Findings (research, health, exome sequencing, whole genome sequencing)</li>
<li><a href="https://isogg.org/wiki/Genebase" title="Genebase">Genebase</a>&nbsp;(deep ancestry, genealogy)</li>
<li><a href="https://www.genotek.ru/">GenoTek</a>&nbsp;(admixture, genealogy, diet and fitness, family planning, health, talents and sports) A company catering for the Russian market</li>
<li><a href="https://isogg.org/wiki/Genographic_Project" title="Genographic Project">Genographic Project</a>&nbsp;(admixture, deep ancestry)</li>
<li><a href="http://www.genos.co/">Genos Research Inc</a>&nbsp;(DTC whole exome sequencing; consumer focused healthcare big data spin out from Complete Genomics; Note: no genetic genealogy focus or tools)</li>
<li><a href="http://www.guardiome.com/">Guardiome</a>&nbsp;(admixture, whole genome sequencing and interpretation)</li>
<li><a href="https://www.helix.com/">Helix</a>&nbsp;(exome sequencing) US supplier of the&nbsp;<a href="https://isogg.org/wiki/Genographic_Project" title="Genographic Project">Genographic Project</a>&nbsp;Geno 2.0 Next Generation test</li>
<li><a href="http://www.igenea.com/">iGENEA</a>&nbsp;(<a href="https://isogg.org/wiki/Family_Tree_DNA" title="Family Tree DNA">FTDNA</a>&nbsp;affiliate) (admixture, deep ancestry, genealogy)</li>
<li>IrelandsDNA - See&nbsp;<a href="https://isogg.org/wiki/BritainsDNA" title="BritainsDNA">BritainsDNA</a>&nbsp;(formerly Ethnoancestry)</li>
<li><a href="https://isogg.org/wiki/BritainsDNA" title="BritainsDNA">MyDNA Global</a>&nbsp;- a new name for&nbsp;<a href="https://isogg.org/wiki/BritainsDNA" title="BritainsDNA">BritainsDNA</a></li>
<li><a href="https://www.livingdna.com/">Living DNA</a>&nbsp;(admixture, deep ancestry) See also&nbsp;<a href="https://www.dna-worldwide.com/">DNA Worldwide</a></li>
<li><a href="https://www.myheritage.com/dna">MyHeritage DNA</a>&nbsp;(admixture, genealogy)</li>
<li><a href="https://isogg.org/wiki/Oxford_Ancestors" title="Oxford Ancestors">Oxford Ancestors</a>&nbsp;(deep ancestry)</li>
<li><a href="http://www.rootsforreal.com/">Roots for Real</a>&nbsp;(admixture, deep ancestry)</li>
<li><a href="https://isogg.org/wiki/ScotlandsDNA" title="ScotlandsDNA">ScotlandsDNA</a>&nbsp;- (formerly Ethnoancestry) (admixture, deep ancestry)</li>
<li><a href="https://isogg.org/wiki/Sorenson_Genomics" title="Sorenson Genomics">Sorenson Genomics</a>&nbsp;(laboratory services)</li>
<li><a href="http://www.suregenomics.com/">Sure Genomics</a>&nbsp;(whole genome sequencing and interpretation)</li>
<li>TribeCode See&nbsp;<a href="https://isogg.org/wiki/Centrillion_Biosciences" title="Centrillion Biosciences">Centrillion Biosciences</a></li>
<li><a href="https://www.veritasgenetics.com/">Veritas Genetics</a>&nbsp;(whole genome sequencing and interpretation)</li>
<li><a href="http://xcode.in/">Xcode</a>&nbsp;(Diet and Fitness, Precision medicine, Genotyping, Sequencing, Interpretation)</li>
<li>YorkshiresDNA - See&nbsp;<a href="https://isogg.org/wiki/BritainsDNA" title="BritainsDNA">BritainsDNA</a>&nbsp;(formerly Ethnoancestry)</li>
<li><a href="https://www.wegene.com/">WeGene</a>&nbsp;(admixture, deep ancestry, health, sports, traits) A test tailored for the East Asian market</li>
<li><a href="https://isogg.org/wiki/YSEQ" title="YSEQ">YSEQ</a>&nbsp;(custom Y-SNPs, Y-STRs, SNP panels, whole genome sequencing)</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37987/ropebwt2-incremental-construction-of-fm-index-for-dna-sequences</guid>
	<pubDate>Thu, 25 Oct 2018 04:48:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37987/ropebwt2-incremental-construction-of-fm-index-for-dna-sequences</link>
	<title><![CDATA[RopeBWT2: Incremental construction of FM-index for DNA sequences]]></title>
	<description><![CDATA[<p><span>RopeBWT2 is an tool for constructing the FM-index for a collection of DNA sequences. It works by incrementally inserting one or multiple sequences into an existing pseudo-BWT position by position, starting from the end of the sequences. This algorithm can be largely considered a mixture of&nbsp;</span><a href="http://dx.doi.org/10.1007/978-3-642-21458-5_20">BCR</a><span>&nbsp;and&nbsp;</span><a href="http://dfmi.sourceforge.net/">dynamic FM-index</a><span>. Nonetheless, ropeBWT2 is unique in that it may&nbsp;</span><em>implicitly</em><span>sort the input into reverse lexicographical order (RLO) or reverse-complement lexicographical order (RCLO) while building the index.</span></p><p>Address of the bookmark: <a href="https://github.com/lh3/ropebwt2" rel="nofollow">https://github.com/lh3/ropebwt2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>