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

You Might Also Like
Our Free Plans just got better! | Auth0 by Okta Icon
Our Free Plans just got better! | Auth0 by Okta

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Try free now
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