z-logo
open-access-imgOpen Access
Stitching gene fragments with a network matching algorithm improves gene assembly for metagenomics
Author(s) -
YuWei Wu,
Mina Rho,
Thomas G. Doak,
Yuzhen Ye
Publication year - 2012
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/bts388
Subject(s) - image stitching , metagenomics , matching (statistics) , computer science , algorithm , computational biology , gene , data mining , artificial intelligence , biology , genetics , mathematics , statistics
One of the difficulties in metagenomic assembly is that homologous genes from evolutionarily closely related species may behave like repeats and confuse assemblers. As a result, small contigs, each representing a short gene fragment, instead of complete genes, may be reported by an assembler. This further complicates annotation of metagenomic datasets, as annotation tools (such as gene predictors or similarity search tools) typically perform poorly on configs encoding short gene fragments.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom