TAG is a tool for metatranscriptome assembly using de Bruijn graph of matched metagenome as the reference.

TAG is an application of a reads mapping algorithm that we developed for mapping of short reads onto a de Bruijn graph of assemblies. A hash table of junction k-mers (k-mers spanning branching structures in the de Bruijn graph) is used to facilitate fast mapping of reads to the graph.

We have shown that TAG helps to assemble substantially more transcripts from metatranscriptomic datasets that otherwise would have been missed or truncated because of the fragmented nature of the reference metagenome.

Toy datasets for testing TAG (big file!) can be downloaded from http://omics.informatics.indiana.edu/TAG/.

Reference: Yuzhen Ye and Haixu Tang. Utilizing de Bruijn graph of metagenome assembly for metatranscriptome analysis. Bioinformatics (2015)
doi: 10.1093/bioinformatics/btv510.

Project Activity

See All Activity >

Categories

Bio-Informatics

License

Creative Commons Attribution License

Follow TAG

TAG Web Site

Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of TAG!

Additional Project Details

Registered

2016-02-23