Home > Research > Publications & Outputs > Bioinformatics analysis of large-scale viral se...

Links

Text available via DOI:

View graph of relations

Bioinformatics analysis of large-scale viral sequences: From construction of data sets to annotation of a phylogenetic tree

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Bioinformatics analysis of large-scale viral sequences: From construction of data sets to annotation of a phylogenetic tree. / Munir, Muhammad.
In: Virulence, Vol. 4, No. 1, 01.01.2013, p. 97-106.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Author

Bibtex

@article{3c6864dd4857452bb04bf1723c79cf22,
title = "Bioinformatics analysis of large-scale viral sequences: From construction of data sets to annotation of a phylogenetic tree",
abstract = "Due to a significant decrease in the cost of DNA sequencing, the number of sequences submitted to the public databases has dramatically increased in recent years. Efficient analysis of these data sets may lead to a significant understanding of the nature of pathogens such as bacteria, viruses, parasites, etc. However, this has raised questions about the efficacy of currently available algorithms for the study of pathogen evolution and construction of phylogenetic trees. While the advanced algorithms and corresponding programs are being developed, it is crucial to optimize the available ones in order to cope with the current need. The protocol presented in this study is optimized using a number of strategies currently being proposed for handling large-scale DNA sequence data sets, and offers a highly efficacious and accurate method for computing phylogenetic trees with limited computer resources. The protocol may take up to 36 h for construction and annotation of a final tree of about 20,000 sequences.",
keywords = "Annotation, DNA dataset, Influenza virus, NS gene, Phylogenetic analysis, Viruses",
author = "Muhammad Munir",
year = "2013",
month = jan,
day = "1",
doi = "10.4161/viru.23161",
language = "English",
volume = "4",
pages = "97--106",
journal = "Virulence",
issn = "2150-5594",
publisher = "Taylor and Francis",
number = "1",

}

RIS

TY - JOUR

T1 - Bioinformatics analysis of large-scale viral sequences

T2 - From construction of data sets to annotation of a phylogenetic tree

AU - Munir, Muhammad

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Due to a significant decrease in the cost of DNA sequencing, the number of sequences submitted to the public databases has dramatically increased in recent years. Efficient analysis of these data sets may lead to a significant understanding of the nature of pathogens such as bacteria, viruses, parasites, etc. However, this has raised questions about the efficacy of currently available algorithms for the study of pathogen evolution and construction of phylogenetic trees. While the advanced algorithms and corresponding programs are being developed, it is crucial to optimize the available ones in order to cope with the current need. The protocol presented in this study is optimized using a number of strategies currently being proposed for handling large-scale DNA sequence data sets, and offers a highly efficacious and accurate method for computing phylogenetic trees with limited computer resources. The protocol may take up to 36 h for construction and annotation of a final tree of about 20,000 sequences.

AB - Due to a significant decrease in the cost of DNA sequencing, the number of sequences submitted to the public databases has dramatically increased in recent years. Efficient analysis of these data sets may lead to a significant understanding of the nature of pathogens such as bacteria, viruses, parasites, etc. However, this has raised questions about the efficacy of currently available algorithms for the study of pathogen evolution and construction of phylogenetic trees. While the advanced algorithms and corresponding programs are being developed, it is crucial to optimize the available ones in order to cope with the current need. The protocol presented in this study is optimized using a number of strategies currently being proposed for handling large-scale DNA sequence data sets, and offers a highly efficacious and accurate method for computing phylogenetic trees with limited computer resources. The protocol may take up to 36 h for construction and annotation of a final tree of about 20,000 sequences.

KW - Annotation

KW - DNA dataset

KW - Influenza virus

KW - NS gene

KW - Phylogenetic analysis

KW - Viruses

U2 - 10.4161/viru.23161

DO - 10.4161/viru.23161

M3 - Journal article

AN - SCOPUS:84872874379

VL - 4

SP - 97

EP - 106

JO - Virulence

JF - Virulence

SN - 2150-5594

IS - 1

ER -