<?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/42965?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/42965?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34867/magic-blast-a-tool-for-mapping-large-next-generation-rna-or-dna-sequencing-runs-against-a-whole-genome-or-transcriptome</guid>
	<pubDate>Tue, 26 Dec 2017 22:23:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34867/magic-blast-a-tool-for-mapping-large-next-generation-rna-or-dna-sequencing-runs-against-a-whole-genome-or-transcriptome</link>
	<title><![CDATA[Magic-BLAST: a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome.]]></title>
	<description><![CDATA[<p>Magic-BLAST is a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome. Each alignment optimizes a composite score, taking into account simultaneously the two reads of a pair, and in case of RNA-seq, locating the candidate introns and adding up the score of all exons. This is very different from other versions of BLAST, where each exon is scored as a separate hit and read-pairing is ignored.</p>
<p>Magic-BLAST incorporates within the NCBI BLAST code framework ideas developed in the NCBI Magic pipeline, in particular hit extensions by local walk and jump&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26109056">(http://www.ncbi.nlm.nih.gov/pubmed/26109056)</a>, and recursive clipping of mismatches near the edges of the reads, which avoids accumulating artefactual mismatches near splice sites and is needed to distinguish short indels from substitutions near the edges.</p><p>Address of the bookmark: <a href="https://ncbi.github.io/magicblast/" rel="nofollow">https://ncbi.github.io/magicblast/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36456/alpaca-a-hybrid-strategy-for-assembly-of-genomic-dna-shotgun-sequencing-reads</guid>
	<pubDate>Mon, 30 Apr 2018 04:38:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36456/alpaca-a-hybrid-strategy-for-assembly-of-genomic-dna-shotgun-sequencing-reads</link>
	<title><![CDATA[ALPACA: A hybrid strategy for assembly of genomic DNA shotgun sequencing reads.]]></title>
	<description><![CDATA[<p><span>ALPACA requires Celera Assembler 8.3 or later. It is recommended to build Celera Assembler from source. (Why? The pre-built binaries CA_8.3rc1 and CA8.3rc2 will work for any large data set.&nbsp;</span></p>
<p><span>Detail paper at&nbsp;https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3927-8</span></p><p>Address of the bookmark: <a href="https://github.com/VicugnaPacos/ALPACA" rel="nofollow">https://github.com/VicugnaPacos/ALPACA</a></p>]]></description>
	<dc:creator>Seema Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</guid>
	<pubDate>Sat, 25 Jan 2020 13:28:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</link>
	<title><![CDATA[DeepVariant : an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.]]></title>
	<description><![CDATA[<p><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.</span></p>
<p><span><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on&nbsp;</span><a href="https://github.com/google/nucleus">Nucleus</a><span>, a library of Python and C++ code for reading and writing data in common genomics file formats (like SAM and VCF) designed for painless integration with the&nbsp;</span><a href="https://www.tensorflow.org/">TensorFlow</a><span>&nbsp;machine learning framework.</span></span></p>
<p><span><a href="https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html">https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html</a></span></p>
<p><span><a href="https://www.biorxiv.org/content/10.1101/092890v6">https://www.biorxiv.org/content/10.1101/092890v6</a></span></p>
<p><span><img src="https://4.bp.blogspot.com/-2KlXZO60sWE/WiGc8qlZfxI/AAAAAAAACOs/s1pNiKI8jsAvJLr1E_po5udDO8eObm_awCLcBGAs/s640/image3.png" width="640" height="427" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/google/deepvariant" rel="nofollow">https://github.com/google/deepvariant</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41825/hnadock-a-nucleic-acid-docking-server-for-modeling-rnadna%E2%80%93rnadna-3d-complex-structures</guid>
	<pubDate>Thu, 04 Jun 2020 23:19:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41825/hnadock-a-nucleic-acid-docking-server-for-modeling-rnadna%E2%80%93rnadna-3d-complex-structures</link>
	<title><![CDATA[HNADOCK: a nucleic acid docking server for modeling RNA/DNA–RNA/DNA 3D complex structures]]></title>
	<description><![CDATA[<p><span>The HNADOCK server is to predict the binding complex structure between two nucleic acid molecules through a hierarchical docking algorihtm of an FFT-based global search strategy and an intrinsic scoring function for nucleic acid interactions. Users are required to provide the three-dimensional (3D) structures of the two molecules to be docked.&nbsp;</span></p><p>Address of the bookmark: <a href="http://huanglab.phys.hust.edu.cn/hnadock/" rel="nofollow">http://huanglab.phys.hust.edu.cn/hnadock/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45244/the-ghost-ancestors-hidden-in-our-dna</guid>
	<pubDate>Tue, 18 Aug 2026 22:16:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45244/the-ghost-ancestors-hidden-in-our-dna</link>
	<title><![CDATA[The Ghost Ancestors Hidden in Our DNA]]></title>
	<description><![CDATA[<p>Imagine standing in a museum of human evolution.</p><p>There are Neanderthal bones. Denisovan remains. Fossils from ancient relatives of our species. Each specimen gives us another piece of the story of how Homo sapiens came to be.</p><p>But now imagine that one of the most important characters in that story has left behind no fossil, no skull, no bone, and no genome.</p><p>Nothing that a paleontologist could put behind glass.</p><p>And yet, somehow, that ancient population is still speaking.</p><p>It is speaking through us.</p><p>A fascinating new study published in Science (https://www.science.org/doi/10.1126/science.aef8874?) introduces a computational method called TRACE, which allows scientists to search modern human genomes for genetic traces of ancient populations that have never been directly identified.</p><p>For years, scientists have known that our ancestors interacted with Neanderthals and Denisovans. Their DNA still survives in modern human populations. But these may not have been the only ancient humans who crossed paths with our ancestors.</p><p>Using TRACE, researchers found evidence of an unknown archaic population that contributed DNA to the ancestors of modern humans before humans spread beyond Africa.</p><p>Even more surprisingly, they found evidence of a much older lineage&mdash;possibly around 1.8 million years old&mdash;whose genetic legacy may have reached some modern humans indirectly through Denisovans.</p><p>The extraordinary part is that researchers did not need DNA from these mysterious populations to detect them. Instead, they studied the ancestry of modern genomes and looked for genetic patterns that revealed unusually ancient branches of our family history.</p><p>It is almost like finding the footprints of someone who disappeared thousands of years ago&mdash;without ever finding the person themselves.</p><p>These discoveries suggest that human evolution was far more complicated than a simple family tree. Ancient human populations repeatedly separated, migrated, met and exchanged genes. Some eventually disappeared, but pieces of their genetic legacy survived.</p><p>And that means our DNA is more than a biological instruction manual.</p><p>It is also an archive of human history.</p><p>Some of the people recorded in that archive may never have a name or a fossil. But thanks to methods like TRACE, their genetic echoes are finally becoming visible.</p><p>The next big discovery about our ancient past may not come from a fossil in the ground.</p><p>It may already be inside us.</p><p>Reference: Zhang et al., &ldquo;Recovering signatures of archaic hominin introgression using ancestral recombination graphs,&rdquo; Science (2026), DOI: 10.1126/science.aef8874. Detail paper @&nbsp;https://www.science.org/doi/10.1126/science.aef8874?</p><p><br />The TRACE repository (https://github.com/YulinZhang9806/trace) contains the Python package and command-line tools used to infer archaic admixture tracts from ancestral recombination graphs.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</guid>
	<pubDate>Tue, 12 Jun 2018 12:41:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</link>
	<title><![CDATA[Breakpointer: using local mapping artifacts to support sequence breakpoint discovery from single-end reads]]></title>
	<description><![CDATA[Breakpointer is a fast tool for locating sequence breakpoints from the alignment of single end reads (SE) produced by next generation sequencing (NGS). It adopts a heuristic method in searching for local mapping signatures created by insertion/deletions (indels) or more complex structural variants(SVs).<p>Address of the bookmark: <a href="https://github.com/ruping/Breakpointer" rel="nofollow">https://github.com/ruping/Breakpointer</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26569/genome-stability-laboratory</guid>
  <pubDate>Mon, 07 Mar 2016 04:16:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Genome Stability Laboratory]]></title>
  <description><![CDATA[
<p>The bakers yeast, Saccharomyces cerevisiae is an ideal model organism to understand mechanisms of meiotic chromosome segregation. In S. cerevisiae and in mammals, the majority of meiotic crossovers are formed through a highly conserved MSH4p-MSH5p, MLH1p-MLH3p dependent pathway. We are interested in charactering the role of these complexes in crossover formation and distribution among all homolog pairs. Errors in this process are linked to congenital birth defects in humans such as Down's syndrome.Our laboratory is also interested in understanding the effect of genetic background on mutation rate variation using S. cerevisiae as a model. These studies are relevant for understanding cancer progression, genome evolution and architecture. We use high- throughput genomic methods as well as classical genetics to achieve these aims. </p>

<p>More at http://faculty.iisertvm.ac.in/~nishantkt/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37820/s-plot2-rapid-visual-and-statistical-analysis-of-genomic-sequences</guid>
	<pubDate>Tue, 02 Oct 2018 17:57:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37820/s-plot2-rapid-visual-and-statistical-analysis-of-genomic-sequences</link>
	<title><![CDATA[S-plot2: Rapid Visual and Statistical Analysis of Genomic Sequences]]></title>
	<description><![CDATA[<p><span>S-plot2 creates an interactive, two-dimensional heatmap capturing the similarities and dissimilarities in nucleotide usage between genomic sequences (partial or complete). In S-plot2, whole eukaryotic chromosomes and smaller prokaryotic genomes can be efficiently compared. The tool includes functionality to extract, analyze, and automate BLAST queries of regions of interest within the heatmap. This facilitates the investigation of quickly evolving coding regions, novel coding regions, and laterally transferred elements.</span></p><p>Address of the bookmark: <a href="https://bitbucket.org/lkalesinskas/splot" rel="nofollow">https://bitbucket.org/lkalesinskas/splot</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41948/predict-gene-ontology-with-sequences</guid>
	<pubDate>Wed, 08 Jul 2020 04:59:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41948/predict-gene-ontology-with-sequences</link>
	<title><![CDATA[Predict Gene Ontology with sequences !]]></title>
	<description><![CDATA[<p><strong>PANNZER</strong>&nbsp;(Protein ANNotation with Z-scoRE) is a fully automated service for functional annotation of prokaryotic and eukaryotic proteins of unknown function. The tool is designed to predict the functional description (DE) and GO classes.</p>
<p>PANNZER2 processes bacterial proteomes in minutes and eukaryotic proteomes in an hour. You can use&nbsp;<a href="http://ekhidna2.biocenter.helsinki.fi/AAI/">AAI-profiler</a>&nbsp;to summarize a proteome's species neighbors and reveal taxonomic identity or contamination.</p>
<p>http://ekhidna2.biocenter.helsinki.fi/sanspanz/</p>
<p>IterPro is for the beginners</p>
<p><a href="https://www.ebi.ac.uk/interpro/">h</a><a href="https://www.ebi.ac.uk/interpro/">ttps://www.ebi.ac.uk/interpro/</a></p>
<p>You can find other comparative info at&nbsp;<a href="https://academic.oup.com/view-large/118391389">https://academic.oup.com/view-large/118391389</a></p><p>Address of the bookmark: <a href="http://ekhidna2.biocenter.helsinki.fi/sanspanz/" rel="nofollow">http://ekhidna2.biocenter.helsinki.fi/sanspanz/</a></p>]]></description>
	<dc:creator>LEGE</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>

</channel>
</rss>