MetaPA is a de Bruijn graph algorithm to obtain complete protein coding genes by assembling metagenomic and metatranscriptomic short reads.

Jiemeng Liu*, Qichao Lian*, Yamao Chen, Ji Qi. (2019) Amino acid based de Bruijn graph algorithm for identifying complete coding genes from metagenomic and metatranscriptomic short reads. Nucleic Acids Research.

Features

  • assembly
  • metagenome
  • metatranscriptome
  • de Bruijn graph

Project Activity

See All Activity >

Follow MetaPA

MetaPA Web Site

Other Useful Business Software
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

Build gen AI apps with an all-in-one modern database: MongoDB Atlas

MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of MetaPA!

Additional Project Details

Registered

2016-10-02
Report inappropriate content