alexa
Reach Us +44-7482-878921
Scalable SNP Analyses of 100+ Bacterial or Viral Genomes | OMICS International | Abstract
ISSN: 2157-7145

Journal of Forensic Research
Open Access

Like us on:

Our Group organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations
700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Research Article

Scalable SNP Analyses of 100+ Bacterial or Viral Genomes

Shea N. Gardner* and Tom Slezak

Lawrence Livermore National Laboratory, Livermore, Computations/Global Security, PO Box 808, L-174, CA 94551

*Corresponding Author:
Shea N. Gardner
Lawrence Livermore National Laboratory
Livermore CA 94551
Tel: 925-422-4317
Fax: 925-423-6437
E-mail: [email protected]

Received date: November 25, 2010; Accepted date: December 27, 2010; Published date: December 30, 2010

Citation: Gardner SN, Slezak T (2010) Scalable SNP Analyses of 100+ Bacterial or Viral Genomes. J Forensic Res 1:107. doi: 10.4172/2157-7145.1000107

Copyright: © 2010 Gardner SN, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Abstract

With the flood of whole genome finished and draft microbial sequences, analysts need faster, more scalable bioinformatics tools for sequence comparison. An algorithm is described to find single nucleotide polymorphisms (SNPs) in whole genome data. It scales to hundreds of bacterial or viral genomes, and can be used for finished and/ or draft genomes available as unassembled contigs. The method is fast to compute, finding SNPs and building a SNP phylogeny in seconds to hours. It identified thousands of putative SNPs from all publicly available Filoviridae, Poxviridae, foot-and-mouth disease virus, Bacillus, and Escherichia coli genomes and plasmids. The SNP-based trees it generated were consistent with known taxonomy and trees determined in other studies. The approach described can handle as input hundreds of megabases of sequence in a single run. The algorithm kSNP is based on k-mer analysis using suffix arrays and requires no multiple sequence alignment.

Keywords

Recommended Conferences

7th World Congress on Epigenetics and Chromosome

Zurich, Switzerland

5th International Conference on Forensic Psychology & Criminology

Prague, Czech Republic
Share This Page
Top