<?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/39872?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/39872?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38310/sisrs-site-identification-from-short-read-sequences</guid>
	<pubDate>Wed, 28 Nov 2018 08:56:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38310/sisrs-site-identification-from-short-read-sequences</link>
	<title><![CDATA[SISRS: Site Identification from Short Read Sequences]]></title>
	<description><![CDATA[<p>Next-gen sequence data such as Illumina HiSeq reads. Data must be sorted into folders by taxon (e.g. species or genus). Paired reads in fastq format must be specified by _R1 and _R2 in the (otherwise identical) filenames. Paired and unpaired reads must have a fastq file extension.</p><p>Address of the bookmark: <a href="https://github.com/rachelss/SISRS" rel="nofollow">https://github.com/rachelss/SISRS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43799/kast</guid>
	<pubDate>Wed, 23 Feb 2022 08:28:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43799/kast</link>
	<title><![CDATA[KAST]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37751/kast-perform-alignment-free-k-tuple-frequency-comparisons-from-sequences</guid>
	<pubDate>Thu, 20 Sep 2018 08:56:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37751/kast-perform-alignment-free-k-tuple-frequency-comparisons-from-sequences</link>
	<title><![CDATA[KAST: Perform Alignment-free k-tuple frequency comparisons from sequences]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</guid>
	<pubDate>Sun, 09 Dec 2018 19:06:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</link>
	<title><![CDATA[DECIPHER; a software toolset for deciphering and managing biological sequences efficiently using the R]]></title>
	<description><![CDATA[<p><span>DECIPHER is a software toolset that can be used for deciphering and managing biological sequences efficiently using the&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;programming language. The&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;package is distributed as platform independent source code under the&nbsp;</span><a href="http://www.gnu.org/copyleft/gpl.html">GPL version 3 license</a><span>. Some functionality of the program is accessible online through web tools.</span></p>
<p><span style="font-size: medium; text-align: justify;">&nbsp;</span></p><p>Address of the bookmark: <a href="http://www2.decipher.codes/" rel="nofollow">http://www2.decipher.codes/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39624/cogent-a-tool-for-reconstructing-the-coding-genome-using-high-quality-full-length-transcriptome-sequences</guid>
	<pubDate>Tue, 18 Jun 2019 05:33:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39624/cogent-a-tool-for-reconstructing-the-coding-genome-using-high-quality-full-length-transcriptome-sequences</link>
	<title><![CDATA[Cogent: a tool for reconstructing the coding genome using high-quality full-length transcriptome sequences.]]></title>
	<description><![CDATA[<div id="yui_3_14_1_1_1560853173251_3865">Cogent is a tool that identifies gene&nbsp;families and reconstructs the coding genome using high-quality transcriptome data without a reference genome, and can be used to check&nbsp;assemblies&nbsp;for the presence of&nbsp;these known coding sequences.</div>
<div>&nbsp;</div>
<div>
<p>Cogent is a tool for reconstructing the coding genome using high-quality full-length transcriptome sequences. It is designed to be used on&nbsp;<a href="https://github.com/PacificBiosciences/cDNA_primer/wiki">Iso-Seq data</a>&nbsp;and in cases where there is no reference genome or the ref genome is highly incomplete.</p>
<p>See a&nbsp;<a href="https://www.dropbox.com/s/mn6hwhguh0pqceu/20160106_Cogent_developers_conference_slides_Cuttlefish.pdf?dl=0">recent presentation</a>&nbsp;on Cogent being applied to the Cuttlefish Iso-Seq data.</p>
<p><a href="https://www.dropbox.com/s/kz0gi7qg0w82k9a/20161026_Cogent_manuscript_forGitHub.pdf?dl=0">Cogent preliminary draft paper (updated 2016Dec version)</a>,&nbsp;<a href="https://www.dropbox.com/s/37412o8glvnfhf9/20161026_Cogent_ManuscriptPlusSupplement_forGitHub.pdf?dl=0">Supplementary</a></p>
<p>Please see&nbsp;<a href="https://github.com/Magdoll/Cogent/wiki">wiki</a>&nbsp;for details on usage.</p>
</div><p>Address of the bookmark: <a href="https://github.com/Magdoll/Cogent" rel="nofollow">https://github.com/Magdoll/Cogent</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43815/kebabs-package-provides-functionality-for-kernel-based-analysis-of-biological-sequences-via-support-vector-machine-svm-based-methods</guid>
	<pubDate>Fri, 04 Mar 2022 00:14:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43815/kebabs-package-provides-functionality-for-kernel-based-analysis-of-biological-sequences-via-support-vector-machine-svm-based-methods</link>
	<title><![CDATA[kebabs: package provides functionality for kernel based analysis of biological sequences via Support Vector Machine (SVM) based methods]]></title>
	<description><![CDATA[<p><span>The&nbsp;</span><tt>kebabs</tt><span>&nbsp;package provides functionality for kernel based analysis of biological sequences via Support Vector Machine (SVM) based methods. Biological sequences include DNA, RNA, and amino acid (AA) sequences. Sequence kernels define similarity measures between sequences. The package implements some of the most important kernels for sequence analysis in a very flexible and efficient way and extends the standard position-independent functionality of these kernels in a novel way to take the position of patterns in the sequences into account for the similarity measure.</span></p>
<p>http://www.bioinf.jku.at/software/kebabs/</p>
<p>http://bioconductor.org/packages/release/bioc/vignettes/kebabs/inst/doc/kebabs.pdf</p><p>Address of the bookmark: <a href="http://www.bioinf.jku.at/software/kebabs/" rel="nofollow">http://www.bioinf.jku.at/software/kebabs/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44878/jaeger-an-accurate-and-fast-deep-learning-tool-to-detect-bacteriophage-sequences</guid>
	<pubDate>Thu, 14 Aug 2025 04:02:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44878/jaeger-an-accurate-and-fast-deep-learning-tool-to-detect-bacteriophage-sequences</link>
	<title><![CDATA[Jaeger : an accurate and fast deep-learning tool to detect bacteriophage sequences]]></title>
	<description><![CDATA[<p dir="auto">Jaeger is a tool that utilizes homology-free machine learning to identify phage genome sequences that are hidden within metagenomes. It is capable of detecting both phages and prophages within metagenomic assemblies.</p>
<p dir="auto">The performance of the Jaeger workflow can be significantly increased by utilizing GPUs. To enable GPU support, the CUDA Toolkit and cuDNN library must be accessible to conda.</p>
<div>
<pre><code># setup bioconda
conda config --add channels defaults
conda config --add channels bioconda
conda config --add channels conda-forge
conda config --set channel_priority strict

# create conda environment and install jaeger
mamba create -n jaeger -c nvidia -c conda-forge cuda-nvcc "python&gt;=3.9,&lt;3.12" pip jaeger-bio


# activate environment
conda activate jaeger</code></pre>
</div><p>Address of the bookmark: <a href="https://github.com/MGXlab/Jaeger" rel="nofollow">https://github.com/MGXlab/Jaeger</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</guid>
	<pubDate>Mon, 19 Dec 2016 14:20:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</link>
	<title><![CDATA[pyScaf]]></title>
	<description><![CDATA[<p>pyScaf orders contigs from genome assemblies utilising several types of information:</p>
<ul>
<li>paired-end (PE) and/or mate-pair libraries (<a href="https://github.com/lpryszcz/pyScaf#ngs-based-scaffolding">NGS-based mode</a>)</li>
<li>long reads (<a href="https://github.com/lpryszcz/pyScaf#scaffolding-based-on-long-reads">NGS-based mode</a>)</li>
<li>synteny to the genome of some related species (<a href="https://github.com/lpryszcz/pyScaf#reference-based-scaffolding">reference-based mode</a>)</li>
</ul>
<p>Scaffolding&nbsp;</p>
<p>In reference-based mode, pyScaf uses synteny to the genome of closely related species in order to order contigs and estimate distances between adjacent contigs.</p>
<p>Contigs are aligned globally (end-to-end) onto reference chromosomes, ignoring:</p>
<ul>
<li>matches not satisfying cut-offs (<code>--identity</code>&nbsp;and&nbsp;<code>--overlap</code>)</li>
<li>suboptimal matches (only best match of each query to reference is kept)</li>
<li>and removing overlapping matches on reference.</li>
</ul>
<p>In preliminary tests, pyScaf performed superbly on simulated heterozygous genomes based on&nbsp;<em>C. parapsilosis</em>&nbsp;(13 Mb; CANPA) and&nbsp;<em>A. thaliana</em>&nbsp;(119 Mb; ARATH) chromosomes, reconstructing correctly all chromosomes always for CANPA and nearly always for ARATH (<a href="https://www.dropbox.com/sh/bb7lwggo40xrwtc/AAAZ7pByVQQQ-WhUXZVeJaZVa/pyScaf?dl=0">Figures in dropbox</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=2036953672">CANPA table</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=1920757821">ARATH table</a>).<br>Runs took ~0.5 min for CANPA on&nbsp;<code>4 CPUs</code>&nbsp;and ~2 min for ARATH on&nbsp;<code>16 CPUs</code>.</p>
<p><span>Important remarks:</span></p>
<ul>
<li>Reduce your assembly before (fasta2homozygous.py) as any redundancy will likely break the synteny.</li>
<li>pyScaf works better with contigs than scaffolds, as scaffolds are often affected by mis-assemblies (no&nbsp;<em>de novo assembler</em>&nbsp;/ scaffolder is perfect...), which breaks synteny.</li>
<li>pyScaf works very well if divergence between reference genome and assembled contigs is below 20% at nucleotide level.</li>
<li>pyScaf deals with large rearrangements ie. deletions, insertion, inversions, translocations.&nbsp;<span>Note however, this is experimental implementation!</span></li>
<li>Consider closing gaps after scaffolding.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/lpryszcz/pyScaf" rel="nofollow">https://github.com/lpryszcz/pyScaf</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43319/k-mers-tutorial-classification-and-taxonomy</guid>
	<pubDate>Thu, 26 Aug 2021 10:28:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43319/k-mers-tutorial-classification-and-taxonomy</link>
	<title><![CDATA[k-mers tutorial - classification and taxonomy]]></title>
	<description><![CDATA[<p>DNA k-mers underlie much of our assembly work, and we (along with many others!) have spent a lot of time thinking about how to&nbsp;<a href="http://www.pnas.org/content/109/33/13272">store k-mer graphs efficiently</a>,&nbsp;<a href="http://ivory.idyll.org/blog/what-is-diginorm.html">discard redundant data</a>, and&nbsp;<a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0101271">count them efficiently</a>.</p>
<p>More recently, we've been enthused about&nbsp;<a href="http://joss.theoj.org/papers/3d793c6e7db683bee7c03377a4a7f3c9">using k-mer based similarity measures</a>&nbsp;and&nbsp;<a href="http://ivory.idyll.org/blog/2016-sourmash-sbt.html">computing and searching k-mer-based sketch search databases for all the things</a>.</p>
<p>But I haven't spent too much talking about using k-mers for taxonomy, although that has become an&nbsp;<em>ahem</em>&nbsp;area of interest recently,&nbsp;<a href="http://www.biorxiv.org/content/early/2017/07/03/155358">if you read into our papers a bit</a>.</p>
<p>In this blog post I'm going to fix this by doing a little bit of a literature review and waxing enthusiastic about other people's work. Then in a future blog post I'll talk about how we're building off of this work in fun! and interesting? ways!</p><p>Address of the bookmark: <a href="http://ivory.idyll.org/blog/2017-something-about-kmers.html" rel="nofollow">http://ivory.idyll.org/blog/2017-something-about-kmers.html</a></p>]]></description>
	<dc:creator>Neel</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>

</channel>
</rss>