Title :

Structural pattern matching of nonribosomal peptides.

Author(s) :

Caboche, Ségolène [Auteur correspondant]
Laboratoire des Procédés Biologiques Génie Enzymatique et Microbien [PROBIOGEM]
Sequential Learning [SEQUOIA]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Pupin, Maude [Auteur]
Sequential Learning [SEQUOIA]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Leclere, Valerie [Auteur]
Laboratoire des Procédés Biologiques Génie Enzymatique et Microbien [PROBIOGEM]
Jacques, Philippe [Auteur]
Laboratoire des Procédés Biologiques Génie Enzymatique et Microbien [PROBIOGEM]
Kucherov, Gregory [Auteur]
Sequential Learning [SEQUOIA]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]

Journal title :

BMC Structural Biology

Publisher :

BioMed Central

Publication date :

2009

ISSN :

1472-6807

Keyword(s) :

non-ribosomal peptides
graph comparison

HAL domain(s) :

Informatique [cs]/Bio-informatique [q-bio.QM]
Sciences du Vivant [q-bio]/Bio-Informatique, Biologie Systémique [q-bio.QM]

English abstract : [en]

Nonribosomal peptides (NRPs), bioactive secondary metabolites produced by many microorganisms, show a broad range of important biological activities (e.g. antibiotics, immunosuppressants, antitumor agents). NRPs are mainly ...
Show more >Nonribosomal peptides (NRPs), bioactive secondary metabolites produced by many microorganisms, show a broad range of important biological activities (e.g. antibiotics, immunosuppressants, antitumor agents). NRPs are mainly composed of amino acids but their primary structure is not always linear and can contain cycles or branchings. Furthermore, there are several hundred different monomers that can be incorporated into NRPs. The NORINE database, the first resource entirely dedicated to NRPs, currently stores more than 700 NRPs annotated with their monomeric peptide structure encoded by undirected labeled graphs. We developed an efficient method that allows for a quick search for a structural pattern in the NORINE database. The method identifies all peptides containing a pattern substructure of a given size. This amounts to solving a variant of the maximum common subgraph problem on pattern and peptide graphs, which is done by computing cliques in an appropriate compatibility graph.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL