outer membrane proteins ( omps ) occur in gram - negative bacteria as well as in eukaryotic organelles of endosymbiotic origin , such as mitochondria and plastids ( 1 ) . except for the recently discovered -helical omp wza from escherichia coli ( 2 ) , bacterial omps belong to the functionally diverse group of outer membrane -barrels ( ombbs ) .
their transmembrane ( tm ) domains consist of -hairpins in a barrel - shaped arrangement , forming a closed -sheet around a central pore .
ombbs vary greatly in size , the -barrels consisting of between 8 and 24 -strands ( 3,4 ) .
they generally have an even number of -strands , with the exception of vdac-1 , a mitochondrial ombb with 19 -strands ( 5,6 ) .
omps are involved in a broad range of biological functions such as active and passive transport , enzymatic activity , cell adhesion and structural anchoring .
sometimes , their very extended surface - exposed loops are prominent epitopes , which are exploited in vaccine development and strain typing with immunological methods .
previous methods to predict the occurrence and topology ( i.e. number and location of strands ) of ombbs from sequence data have mostly used analogous features such as amino acid composition or alternating hydrophobicity patterns ( 7,8 ) , either implicitly , such as in neural network and svm - based methods ( 911 ) , or explicitly , such as in tmb - hunt , which applies a k - nearest neighbour algorithm to the whole - sequence amino acid composition ( 12,13 ) , or in bomp , which employs c - terminal pattern recognition combined with a sliding window analysis of amino acids frequencies in alternating positions ( 14 ) .
transfold is a topology prediction method that employs statistical pair potentials to predict inter--strand contacts ( 15,16 ) .
the best - performing ombb predictors , such as proftmb ( 18 ) , have specially designed hidden markov models ( hmms ) .
these possess a circular topology containing states for upward and downward -strands and two groups of states for the inner and outer loops ( 1821 ) .
in contrast to existing methods , our omp prediction and classification server explicitly makes use of the fact that almost all ombbs , spanning sizes from 8 to 24 strands , are homologous to each other ( m. remmert et al . , submitted for publication ) ( 22 ) .
their structural similarity is not sufficient to demonstrate homology , since structure space is limited by a finite number of arrangements of secondary structure elements and hence structural convergence can not be excluded ( 23 ) .
a tried and reliable indication for homology is significant sequence similarity , because sequence space is vast and sequence convergence therefore unlikely ( 24,25 ) .
we use profile  profile comparison methods , since sequence profiles conserve the signature of proteins past for much longer than their sequences .
we assemble a database of putative omps by exhaustive , transitive homology detection starting from known omps .
the database is likely to be nearly complete , as indicated by the 97% coverage of known omps in the e. coli genome ( table s1 ) and our other benchmark results ( figure 1 , table 1 ) .
hhomp searches this database using an omp - specific extension of hhsearch , a method for pairwise profile hmm comparison ( 26 ) that integrates the omp predictions from proftmb ( 18 ) .
in addition , hhomp shows excellent performance in assigning omp sequences to the correct functional subgroups . 

table 1.number of proteins predicted as omps by hhomp and proftmb for various genomesorganism classorganismproteinshhomp hits with probproftmb hits with score100 ( % ) > 90 ( % ) > 10>7archaeaaeropilum pernix18410004 ( 0.2%)methanocaldococcus jan.1784001 ( 0.1%)2 ( 0.1%)gram - positive bacteriastaphylococcus aureus261801 ( 0.04)6 ( 0.2%)13 ( 0.5%)bacillus subtilis41020008 ( 0.2%)corynebacterium diphtheriae227201 ( 0.04)3 ( 0.1%)20 ( 0.9%)lactobacillus casei2771004 ( 0.1%)17 ( 0.6%)gram - negative bacteriaescherichia coli424071 ( 1.7)77 ( 1.8)29 ( 0.7%)82 ( 1.9%)neisseria meningitidis206334 ( 1.6)36 ( 1.7)10 ( 0.5%)26 ( 1.2%)agrobacterium tumefaciens528836 ( 0.7)39 ( 0.8)26 ( 0.5%)98 ( 1.8%)bartonella henselae148829 ( 1.9)31 ( 2.1)7 ( 0.5%)21 ( 1.4%)cyanobacteriasynechococcus289220 ( 0.7)26 ( 0.9)2 ( 0.1%)32 ( 1.1%)eucaryasaccharomyces cerevisiae58691 ( 0.02)4 ( 0.07)20 ( 0.3%)64 ( 1.0%)homo sapiens34 1431 ( 0)20 ( 0.1)74 ( 0.2%)362 ( 1.0%)gram - positive bacteria and archaea do not have an outer membrane and should therefore not possess omps .
note that the error rate of hhomp at 90% probability is significant lower than the error rate of proftmb at a score of 10 . in most gram - negative bacteria
, hhomp detects > 1.5% omps with 100% , over twice more than proftmb at a score of 10 . in yeast
figure 1.roc plot comparing hhomp with the -barrel prediction methods proftmb , tmb - hunt and bomp . the true positives ( tps ) set consists of the 2164 proteins annotated as omps in transportdb without a blast e - value < 0.01 to any of the 23 proteins in our trainings set .
the effective error rate is the number of effective fps divided by the sum of tps and effective fps are defined as fps multiplied with 21 to obtain the same fraction of omps in the benchmark set as in gram - negative genomes ( 2% ) ( 1 ) .
number of proteins predicted as omps by hhomp and proftmb for various genomes gram - positive bacteria and archaea do not have an outer membrane and should therefore not possess omps .
note that the error rate of hhomp at 90% probability is significant lower than the error rate of proftmb at a score of 10 . in most gram - negative bacteria , hhomp detects > 1.5% omps with 100% , over twice more than proftmb at a score of 10 . in yeast
roc plot comparing hhomp with the -barrel prediction methods proftmb , tmb - hunt and bomp . the true positives ( tps ) set consists of the 2164 proteins annotated as omps in transportdb without a blast e - value < 0.01 to any of the 23 proteins in our trainings set .
the effective error rate is the number of effective fps divided by the sum of tps and effective fps are defined as fps multiplied with 21 to obtain the same fraction of omps in the benchmark set as in gram - negative genomes ( 2% ) ( 1 ) .
the underlying sequences were identified by the exhaustive , transitive sequence search method hhsenser ( 27 ) . to obtain representative bona fide omps as starting points for the transitive searches , we filtered the sequences of all bacterial omps in the protein data bank ( pdb ) ( 28 ) for a maximum of 25% pairwise sequence identity . for each of these 23 proteins ( table s2 )
, we performed an hhsenser run , searching through all bacterial sequences in the ncbi non - redundant ( nr ) database , and all sequences in the ncbi environmental database ( both filtered for 90% maximum pairwise sequence identity ) .
we pooled the largely overlapping results from these 23 searches into a nr database of over 20 000 proteins .
note that , to collect the sequences in the omp database , the only information about omps we used was the identity of the 23 omps of known structure .
we did not use any annotation such as that contained in swissprot or transportdb for filtering or complementing this sequence set .
because the exhaustive hhsenser searches produce only sequence fragments that can be aligned reliably with one of the 23 starting omps in a transitive chain , we extracted the corresponding full - length sequences from the nr and environmental database for each of the fragments .
the full - length sequences were then clustered and visualized with clans ( 29 ) . in clans , sequences attract each other with a strength proportional to their pairwise blast ( 30 ) log e - values , so that similar sequences come to lie closely together . clusters in this cluster map were defined by visual analysis .
fifty five percent of the clusters contained only hypothetical proteins and thus likely represent as yet unknown groups of omps .
these were not removed for the benchmarks to permit a realistic estimation of the fp rate .
a profile hmm was built for each cluster from a multiple alignment of its sequences ( 31 ) .
in addition to amino acid and gap frequencies , the database hmms contain the secondary structure predicted by psipred ( 32 ) and the -barrel structure predicted by proftmb ( 18 ) .
given a sequence as input , hhomp builds a profile hmm by searching homologous sequences with buildali.pl from the hhsearch package ( 26 ) with default parameters .
we predict the secondary structure and the -barrel strands using psipred and proftmb in the same way as for the database hmms .
this profile hmm is compared with the database of precomputed putative omp hmms ( see below ) .
the result is a list of omp clusters , ranked by probability of a correct match . in the following ,
we explain how we have adapted hhsearch to the special case of omp prediction . 

we combine the score between pairs of hmm columns in hhsearch with a score that measures how well the omp -strand predictions from proftmb match between query and database profiles .
this -barrel score sbb is added to the amino acid match score in the viterbi algorithm of hhsearch with a weight factor wbb in the same way as is done for the secondary structure score ( 26 ) . for each column in the profile hmm ,
proftmb predicts one of four -barrel states ,   { i , o , u , d } ( inner and outer loop , upward and downward strand ) , together with a confidence value c  { 1 , 3 , 5 , 7 , 9}. to compare a predicted -barrel state (  , c ) with a -barrel state  of known structure , we construct five 4  4 substitution matrices , one for each value of c. as training set , we used 17 ombb sequences with manually identified -barrel states and 500 random non - omp sequences .
for all 517 proteins , we performed a proftmb prediction and estimated the probabilities p( ;  , c ) from the observed counts between predicted state (  , c ) and manually annotated state . for simplicity , hhomp compares predicted states with each other , even when one of the structures is known .
the log - odds score between predicted states (  , c ) and (  , c ) is 

 where the model probability in the numerator is the probability that both predicted states are obtained from an ancestral state  , summed over all possible states .to avoid fp matches with non - tm domains , hhomp requires that a certain minimum number of query sequence residues is aligned to the predicted tm region of the database hmm .
we use a minimum coverage of 50 amino acids and a minimum raw score of 50 in the predicted tm region . to predict the tm regions in the database hmms
the predicted tm region in the database hmm was defined as comprising all residues aligned to the tm domain of at least one of the best five omp matches in the scop database.not all profile hmms in the omp database are equally likely to represent omps . for each database match x , hhomp reports the corresponding probability that the query protein is an omp , calculated according to the following formula : 


 the probabilies prob(x is omp ) are estimated for the entire database by searching with each database hmm x through all omps in the pdb and setting these probabilities to the match probability of the best - matching omp .
we combine the score between pairs of hmm columns in hhsearch with a score that measures how well the omp -strand predictions from proftmb match between query and database profiles .
this -barrel score sbb is added to the amino acid match score in the viterbi algorithm of hhsearch with a weight factor wbb in the same way as is done for the secondary structure score ( 26 ) . for each column in the profile hmm
, proftmb predicts one of four -barrel states ,   { i , o , u , d } ( inner and outer loop , upward and downward strand ) , together with a confidence value c  { 1 , 3 , 5 , 7 , 9}. to compare a predicted -barrel state (  , c ) with a -barrel state  of known structure , we construct five 4  4 substitution matrices , one for each value of c. as training set , we used 17 ombb sequences with manually identified -barrel states and 500 random non - omp sequences . for all 517 proteins
c ) from the observed counts between predicted state (  , c ) and manually annotated state . for simplicity , hhomp compares predicted states with each other , even when one of the structures is known .
the log - odds score between predicted states (  , c ) and (  , c ) is 

 where the model probability in the numerator is the probability that both predicted states are obtained from an ancestral state  , summed over all possible states . to avoid fp matches with non - tm domains , hhomp requires that a certain minimum number of query sequence residues is aligned to the predicted tm region of the database hmm .
we use a minimum coverage of 50 amino acids and a minimum raw score of 50 in the predicted tm region . to predict the tm regions in the database hmms
the predicted tm region in the database hmm was defined as comprising all residues aligned to the tm domain of at least one of the best five omp matches in the scop database .
not all profile hmms in the omp database are equally likely to represent omps . for each database match
x , hhomp reports the corresponding probability that the query protein is an omp , calculated according to the following formula : 


we first compare hhomp with the prediction methods proftmb ( 18 ) , bomp ( 14 ) and tmb - hunt ( 12 ) on a test set of annotated omps from transportdb ( 33 ) and 5000 negative , non - omp sequences randomly selected from the scop database ( version 1.69 ) ( 34 ) .
the transportdb contains 4494 outer membrane channels from fully sequenced organisms , which were annotated by experimental and bioinformatic evidence . to avoid testing hhomp on proteins that are similar to one of the 23 proteins with which it was trained ( table s2 )
, we exclude all sequences from the test set that have a blast e - value better than 0.01 or a sequence identity larger than 20% to one of the 23 proteins .
hhomp detects 63.5% of the true positives ( tps ) before including the first fp .
this is 70% more than proftmb , four times more than bomp and 10 times more than tmb - hunt ( figure 1 ) .
note that , in contrast to the other methods , the performance of proftmb is impaired when we use negative sequences with the same mean length as in the positive set ( figure s1 ) . in a second benchmark ,
we count the number of proteins predicted as omps by hhomp and proftmb in various genomes ( table 1 ) .
gram - positive bacteria and archaea do not have an outer membrane and should therefore not possess omps .
we use probability cut - offs of 100% and 90% for hhomp and score cut - offs of 10 and 7 for proftmb [ these cut - offs should correspond roughly to 100% and 90% accuracy ( 18 ) ] . the error rate at these cut - offs can be estimated by dividing the fp hits in gram - positive bacteria and archaea by the total number of proteins in their genomes . in this way , we estimate an error rate of 210 for hhomp at 90% cut - off and of 10 for proftmb at a score of 10 . in gram - negative bacteria , 1.53% of the proteins
hhomp predicts > 1.5% omps in most gram - negative bacteria with a probability of 100% , over twice more than proftmb at a score of 10 .
hhomp detects 57 out of the 59 known e. coli omps in transportdb with > 94% probability , corresponding to an estimated error rate < 2  10 , whereas proftmb identifies 23 at an error rate of 10 ( table s1 ) .
furthermore , hhomp is able to detect omps in eukarya even though its database is built from bacterial protein sequences . in the genome of saccharomyces cerevisiae ,
all of them are tps , comprising the major known mitochondrial ombbs ( 35,36)two vdac isoforms ( gi 6322077 and 6324273 ) , one component of the tom complex ( tom40 , gi 6323859 ) and one component of the sam complex ( sam50 , gi 6324302 ) .
none of these proteins can be identified by proftmb with a score > 7 ( table s3 ) , and none of the 64 proteins predicted by proftmb is annotated as known or putative mitochondrial omp . in human
, hhomp identifies a known mitochondrial omp ( sam 50 homolog ) with 100% probability and a further 17 proteins > 90% probability . of these
, seven are known mitochondrial omps and 10 are fp hits ( table s4 ) .
eight fp had p - values > 0.05 but received high hhomp probabilities through their elevated proftmb scores .
two fps ( ladinin 1 ) matched the n - terminal -helix of the autotransporters , which is part of the ombb domain in the scop domain definition .
in contrast to other omp predictions , hhomp is able to assign proteins to omp families with high reliability . in e. coli ,
all annotated omps are classified correctly when the best - ranked hit is used for the family assignment ( table s1 ) .
a method based on homology detection like hhomp might be favoured by the presented benchmarks : the proteins in transportdb , which were annotated by inference from homologous , experimentally validated omps , might be more easily predicted as ombbs by such a method .
however , this also applies to some extent to tmb - hunt and proftmb , which use homology information by constructing a profile from the query sequence .
note that the two described benchmarks are fair in the sense that hhomp was not given more information than the other ombb predictors .
hhomp 's database of putative ombbs was used as obtained from our automatic searches without modifications ( e.g. adding annotated ombbs from swissprot or transportdb ) . only after the benchmarks we removed four obvious fp clusters .
therefore , the benchmarks provide a rather conservative estimate for hhomp 's prediction performance . one obvious limitation of hhomp is that it can only detect omps that are homologous to known groups with which it was trained .
if a still undiscovered group of ombbs exists that is not homologous to the known ombbs , tools relying on analogous features instead of homology will likely be at an advantage .
the hhomp webserver ( available at http://toolkit.tuebingen.mpg.de/hhomp ) consists of an omp prediction and searching interface and a browsing interface for the underlying omp database . with the prediction interface , the user can search the database with a query protein sequence .
various parameters for alignment building and searching can be modified ( explained in the online help ) .
after a few minutes , the server returns a graphical overview of the matched regions , a detailed and annotated list of matched omp database hmms and the corresponding alignments ( figure 2 ) .
an alternative view of the alignments can be selected , in which the columns of the aligned profile hmms are represented as coloured histograms .
the detected omp hmms are linked to the browsing interface with detailed description pages for the omp clusters , containing alignments and 3d models for the tm domain if available ( figure 2 , upper insert ) .
hhomp is integrated into the mpi bioinformatics toolkit ( 37 ) , which provides a user - friendly framework for job control ( e.g. for running jobs in parallel ) and offers many other tools for sequence analysis . in particular , a 3d model can be built with the modeller software ( 38 ) based on the hhomp results . 

figure 2.hhomp results page with graphical overview of regions matched to omps from the hhomp database , summary results list and detailed alignments .
hhomp results page with graphical overview of regions matched to omps from the hhomp database , summary results list and detailed alignments .
executables for linux ( 32/64bit ) and the hhomp database are freely available for academic users and can be downloaded from ftp://ftp.tuebingen.mpg.de/pub/protevo/hhomp .
the finding that almost all ombbs are homologous to each other irrespective of their number of -strands and hence that they can be predicted and classified using homology detection methods has proved very fruitful .
our omp database , constructed with exhaustive , transitive homology searches , contains only few non - omp sequences , as indicated by the very low number of fp matches in gram - positive bacteria and archaea . regarding the completeness of our omp database
, we note that ( i ) a large number of database clusters contain only hypothetical proteins , ( ii ) we predict nearly all known omps in the e. coli genome and ( iii ) we correctly predict the major mitochondrial ombbs .
this shows that hhomp is able to identify even very distant relatives of the 23 bacterial omps used for training the omp database . in summary , although slower than most other methods , hhomp offers excellent sensitivity at very low error rate for the detection of omps among bacterial and eukaryotic sequences . for the application to entire genomes ,
 outer membrane proteins ( omps ) are the transmembrane proteins found in the outer membranes of gram - negative bacteria , mitochondria and plastids . 
 most prediction methods have focused on analogous features , such as alternating hydrophobicity patterns . here , 
 we start from the observation that almost all -barrel omps are related by common ancestry . 
 we identify proteins as omps by detecting their homologous relationships to known omps using sequence similarity . 
 given an input sequence , hhomp builds a profile hidden markov model ( hmm ) and compares it with an omp database by pairwise hmm comparison , integrating omp predictions by proftmb . 
 a crucial ingredient is the omp database , which contains profile hmms for over 20 000 putative omp sequences . 
 these were collected with the exhaustive , transitive homology detection method hhsenser , starting from 23 representative omps in the pdb database . in a benchmark on transportdb 
 , hhomp detects 63.5% of the true positives before including the first false positive . 
 this is 70% more than proftmb , four times more than bomp and 10 times more than tmb - hunt . in escherichia 
 coli , hhomp identifies 57 out of 59 known omps and correctly assigns them to their functional subgroups . 
 hhomp can be accessed at http://toolkit.tuebingen.mpg.de/hhomp . 
INTRODUCTION
METHOD
RESULTS
WEBSERVER
CONCLUSION
SUPPLEMENTARY DATA
FUNDING
Supplementary Material