Mocca: semi-automatic method for domain hunting

被引：5

作者：

Notredame, C ^{[1
]}

机构：

[1] CNRS, UMR 1889, F-13402 Marseille, France

来源：

BIOINFORMATICS | 2001年 / 17卷 / 04期

关键词：

D O I：

10.1093/bioinformatics/17.4.373

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

Motivation: Multiple OCCurrences Analysis (Mocca) is a new method for repeat extraction. It is based on the T-Coffee package (Notredame et al., JMB, 302, 205-217, 2000). Given a sequence or a set of sequences, and a library of local alignments, Mocca extracts every segment of sequence homologous to a pre-specified master. The implementation is meant for domain hunting and makes it fast and easy to test for new boundaries or extend known repeats in an interactive manner. Mocca is designed to deal with highly divergent protein repeats (less than 30% amino acid identity) of more than 30 amino acids.

引用

页码：373 / 374

页数：2

共 13 条

[1] Gapped BLAST and PSI-BLAST: a new generation of protein database search programs [J].

Altschul, SF ;

Madden, TL ;

Schaffer, AA ;

Zhang, JH ;

Zhang, Z ;

Miller, W ;

Lipman, DJ .

NUCLEIC ACIDS RESEARCH, 1997, 25 (17) :3389-3402

[2] The PROSITE database, its status in 1997 [J].

Bairoch, A ;

Bucher, P ;

Hofmann, K .

NUCLEIC ACIDS RESEARCH, 1997, 25 (01) :217-221

[3] PROTEINS - 1000 FAMILIES FOR THE MOLECULAR BIOLOGIST [J].

CHOTHIA, C .

NATURE, 1992, 357 (6379) :543-544

[4]

Durbin R., 1998, BIOL SEQUENCE ANAL

[5]

Heger A, 2000, PROTEINS, V41, P224, DOI 10.1002/1097-0134(20001101)41:2<224::AID-PROT70>3.0.CO

[6]

2-Z

[7] A METHOD TO RECOGNIZE DISTANT REPEATS IN PROTEIN SEQUENCES [J].

HERINGA, J ;

ARGOS, P .

PROTEINS-STRUCTURE FUNCTION AND GENETICS, 1993, 17 (04) :391-411

[8]

Holm L, 1998, PROTEINS, V33, P88, DOI 10.1002/(SICI)1097-0134(19981001)33:1<88::AID-PROT8>3.0.CO

[9]

2-H

[10] A TIME-EFFICIENT, LINEAR-SPACE LOCAL SIMILARITY ALGORITHM [J].

HUANG, XQ ;

MILLER, W .

ADVANCES IN APPLIED MATHEMATICS, 1991, 12 (03) :337-357

← 1 2 →