Detail paper at https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3927-8

Address of the bookmark: https://github.com/VicugnaPacos/ALPACA

DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on Nucleus, 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 TensorFlow machine learning framework.

https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html

https://www.biorxiv.org/content/10.1101/092890v6

Address of the bookmark: https://github.com/google/deepvariant

Address of the bookmark: http://huanglab.phys.hust.edu.cn/hnadock/

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.

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.

Nothing that a paleontologist could put behind glass.

And yet, somehow, that ancient population is still speaking.

It is speaking through us.

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.

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.

Using TRACE, researchers found evidence of an unknown archaic population that contributed DNA to the ancestors of modern humans before humans spread beyond Africa.

Even more surprisingly, they found evidence of a much older lineage—possibly around 1.8 million years old—whose genetic legacy may have reached some modern humans indirectly through Denisovans.

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.

It is almost like finding the footprints of someone who disappeared thousands of years ago—without ever finding the person themselves.

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.

And that means our DNA is more than a biological instruction manual.

It is also an archive of human history.

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.

The next big discovery about our ancient past may not come from a fossil in the ground.

It may already be inside us.

Reference: Zhang et al., “Recovering signatures of archaic hominin introgression using ancestral recombination graphs,” Science (2026), DOI: 10.1126/science.aef8874. Detail paper @ https://www.science.org/doi/10.1126/science.aef8874?

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.

LAST can:

• Handle big sequence data, e.g:
  • Compare two vertebrate genomes
  • Align billions of DNA reads to a genome
• Indicate the reliability of each aligned column.
• Use sequence quality data properly.
• Compare DNA to proteins, with frameshifts.
• Compare PSSMs to sequences
• Calculate the likelihood of chance similarities between random sequences.
• Do split and spliced alignment.
• Train alignment parameters for unusual kinds of sequence (e.g. nanopore).

Address of the bookmark: http://last.cbrc.jp/

Address of the bookmark: https://gvolante.riken.jp/analysis.html

The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE, http://www.expasy.org/prosite/) to locate cores of important enzymes if they occur.

Address of the bookmark: https://github.com/xzhub/LTR_Finder

               *16S ribosomal RNA (Bacteria and Archaea)

               *18S ribosomal RNA sequences (SSU) from Fungi type and reference material     

               *28S ribosomal RNA sequences (LSU) from Fungi type and reference material

               *Internal transcribed spacer region (ITS) from Fungi type and reference material

You can also download these from the BLAST db FTP area.  See the NCBI Insights post for more detail.

Useful links

-----------------

BLAST form with rRNA/ITS databases

BLAST db download

Targeted loci

If you have any questions or concerns, please contact blast-help@ncbi.nlm.nih.gov

Address of the bookmark: https://academic.oup.com/bioinformatics/article/38/2/344/6375939