Address of the bookmark: http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/

More at http://bmbl.sdstate.edu/DMINDA2/

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4086085/

Address of the bookmark: http://bmbl.sdstate.edu/DMINDA2/

Link to the article: https://academic.oup.com/bioinformaticsadvances/article/3/1/vbad174/7455250?searchresult=1

Link to the software:
https://github.com/Sammccarthypotter/ExRec

Address of the bookmark: https://github.com/Sammccarthypotter/ExRec

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.

It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.

The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.

Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.

It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.

Address of the bookmark: http://mgra.cblab.org/

Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.

All the data on extant species displayed in this browser are from Ensembl.

Address of the bookmark: http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl

Address of the bookmark: https://github.com/reubwn/hgt

Address of the bookmark: https://sourceforge.net/projects/ksnp/files/

Following are the genome assembly tools based on string graph:

1.SGA (String Graph Assembler) https://github.com/jts/sga

Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.

2. SAGE: String-overlap Assembly of GEnomes https://github.com/lucian-ilie/SAGE2

SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.

3. FSG: Fast String Graph

The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.

4.  BASE https://github.com/dhlbh/BASE

It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs. BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.

5. Fermi https://github.com/lh3/fermi/

Fermi is a de novo assembler with a particular focus on assembling Illumina short sequence reads from a mammal-sized genome. In addition to the role of a typical assembler, fermi also aims to preserve heterozygotes which are often collapsed by other assemblers. Its ultimate goal is to find a minimal set of unitigs to represent all the information in raw reads.

If you want to learn about String Graph assembler, please read the following papers -

i) The Fragment Assembly String Graph - E. W. Myers

This paper describes the String Graph concept.

ii) Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin

This earlier paper from Simpson and Durbin

iii) Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin