Computational grammars for interrogation of genomes

Jaron Schaeffer; Afra Held; Guy Tsafnat

doi:10.1007/978-1-4419-1327-2_13

Computational grammars for interrogation of genomes

Jaron Schaeffer^*, Afra Held, Guy Tsafnat

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

3 Citations (Scopus)

Abstract

Antibiotic resistance genes are embedded in mobile genetic elements (MGEs) that spread genes between organisms, even of different species. MGEs are large structures that consist of genes, and protein interaction sites. Although a considerable number of microbial DNA sequences have been published, searching for multi-resistant MGEs remains largely a manual task. This usually involves BLAST searches and a combination of keyword-based searches through sequence annotations and the literature. Using computational grammars, we can automate the recognition of arbitrarily complex sequence structures. In this chapter, we describe computational grammars, showing how they can be used to automate MGE annotation, and give examples of the annotation enabled by such grammars.

Original language	English
Title of host publication	Infectious Disease Informatics
Editors	Vitali Sintchenko
Place of Publication	New York
Publisher	Springer, Springer Nature
Pages	263-278
Number of pages	16
ISBN (Electronic)	9781441913272
ISBN (Print)	9781441913265
DOIs	https://doi.org/10.1007/978-1-4419-1327-2_13
Publication status	Published - 2010
Externally published	Yes

Access to Document

10.1007/978-1-4419-1327-2_13

Cite this

@inbook{0bedf3b81e6f4e03a09227e07a8815f9,

title = "Computational grammars for interrogation of genomes",

abstract = "Antibiotic resistance genes are embedded in mobile genetic elements (MGEs) that spread genes between organisms, even of different species. MGEs are large structures that consist of genes, and protein interaction sites. Although a considerable number of microbial DNA sequences have been published, searching for multi-resistant MGEs remains largely a manual task. This usually involves BLAST searches and a combination of keyword-based searches through sequence annotations and the literature. Using computational grammars, we can automate the recognition of arbitrarily complex sequence structures. In this chapter, we describe computational grammars, showing how they can be used to automate MGE annotation, and give examples of the annotation enabled by such grammars.",

author = "Jaron Schaeffer and Afra Held and Guy Tsafnat",

year = "2010",

doi = "10.1007/978-1-4419-1327-2_13",

language = "English",

isbn = "9781441913265",

pages = "263--278",

editor = "Vitali Sintchenko",

booktitle = "Infectious Disease Informatics",

publisher = "Springer, Springer Nature",

address = "United States",

}

TY - CHAP

T1 - Computational grammars for interrogation of genomes

AU - Schaeffer, Jaron

AU - Held, Afra

AU - Tsafnat, Guy

PY - 2010

Y1 - 2010

N2 - Antibiotic resistance genes are embedded in mobile genetic elements (MGEs) that spread genes between organisms, even of different species. MGEs are large structures that consist of genes, and protein interaction sites. Although a considerable number of microbial DNA sequences have been published, searching for multi-resistant MGEs remains largely a manual task. This usually involves BLAST searches and a combination of keyword-based searches through sequence annotations and the literature. Using computational grammars, we can automate the recognition of arbitrarily complex sequence structures. In this chapter, we describe computational grammars, showing how they can be used to automate MGE annotation, and give examples of the annotation enabled by such grammars.

AB - Antibiotic resistance genes are embedded in mobile genetic elements (MGEs) that spread genes between organisms, even of different species. MGEs are large structures that consist of genes, and protein interaction sites. Although a considerable number of microbial DNA sequences have been published, searching for multi-resistant MGEs remains largely a manual task. This usually involves BLAST searches and a combination of keyword-based searches through sequence annotations and the literature. Using computational grammars, we can automate the recognition of arbitrarily complex sequence structures. In this chapter, we describe computational grammars, showing how they can be used to automate MGE annotation, and give examples of the annotation enabled by such grammars.

UR - http://www.scopus.com/inward/record.url?scp=84864031690&partnerID=8YFLogxK

U2 - 10.1007/978-1-4419-1327-2_13

DO - 10.1007/978-1-4419-1327-2_13

M3 - Chapter

AN - SCOPUS:84864031690

SN - 9781441913265

SP - 263

EP - 278

BT - Infectious Disease Informatics

A2 - Sintchenko, Vitali

PB - Springer, Springer Nature

CY - New York

ER -

Computational grammars for interrogation of genomes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this