 Research
 Open Access
 Published:
Deep analysis and optimization of CARD antibiotic resistance gene discovery models
BMC Genomics volume 20, Article number: 914 (2019)
Abstract
Background
Identification of antibiotic resistance genes from environmental samples has been a critical subdomain of gene discovery which is directly connected to human health. However, it is drawing extraordinary attention in recent years and regarded as a severe threat to human health by many institutions around the world. To satisfy the needs for efficient ARG discovery, a series of online antibiotic resistance gene databases have been published. This article will conduct an indepth analysis of CARD, one of the most widely used ARG databases.
Results
The decision model of CARD is based the alignment score with a single ARG type. We discover the occasions where the model is likely to make false prediction, and then propose an optimization method on top of the current CARD model. The optimization is expected to raise the coherence with BLAST homology relationships and improve the confidence for identification of ARGs using the database.
Conclusions
The absence of public recognized benchmark makes it challenging to evaluate the performance of ARG identification. However, possible wrong predictions and methods for resolving the problem can be inferred by computational analysis of the identification method and the underlying reference sequences. We hope our work can bring insight to the mission of precise ARG type classifications.
Background
In recent years, the emergence of antibiotic resistance is accelerating across the world [1]. A wide spectrum of antibiotics which have saved millions of lives since the 1950s are getting less effective in the treatment of bacterial infections [2], arousing serious attention of medical researchers and public health institutions over the world [3]. The major factors that account for the spread of resistant bacteria are recognized to be the unrestricted use of antibiotic drugs for the treatment of both human and animal diseases, combined with the insufficient efficiency of new drug development [1]. Nonetheless, fast and reliable analysis of genes that cause the resistance to certain drugs is the prerequisite to carry out further steps to design and build solutions. Fortunately, at the same time genome sequencing technology and dedicated bioinformatics software are also evolving rapidly, boosting our ability to deal with the deepening crisis [4].
To satisfy the needs of ARG detection for researchers and medical institutions, a series of antibiotic resistance gene databases have been published online, such as ARDB [5], CARD [6], SARG [7, 8], and NCBIAMRFinder (https://www.ncbi.nlm.nih.gov/pathogens/antimicrobialresistance/AMRFinder/). These databases provide a public platform for efficient computational analysis and collaborative researches [4].
The ARDB [5], a classical comprehensive database that contains over 1000 genes with annotations of their ARG types, has been used in a lot of applications. It’s now no longer maintained and mainly replaced by The Comprehensive Antibiotic Resistance Database (CARD) [6]. Initially online in 2015 and expanded in 2016, CARD now has over 2500 ARG entries with a monthly update. Each entry represents a type of ARG like mcr1 [9, 10], mcr2 [11], etc. And these entries are placed in a hierarchical structure of gene ontology terms which are compatible with the system published by the GO consortium (http://geneontology.org/). For each entry, CARD provides both DNA and protein representative sequences and a bit score threshold to report ARG hits by BLAST alignment. Also, CARD collects over 140,000 sequences from NCBI and classifies them to generate the prevalence data of ARG types in the environment. In later parts of the article, we will use these prevalence sequences to study CARD in detail.
SARG is a more recent ARG databases published in 2016 [7] and expanded in 2018 [8]. Based on ARDB and CARD, it now contains more than 12,000 protein sequences, organized into 1208 categories of ARGs. The categories of sequences are decided by keywordsearching in the ARG type annotations of ARGB and CARD, combined with similarity search of classified sequences in the NCBINR database [9]. Its opensource ARG discovery pipeline will let users set BLAST evalue and identity threshold as parameters (https://github.com/biofuture/Ublastx_stageone).
Another novel ARG database, AMRFinder (NCBI project ID: PRJNA313047), is developed by NCBI bases on CARD. It contains significantly more sequences than CARD (totally over 4000), but additional sequences mostly show high similarity to existing sequences in CARD). An important feature of AMRFinder is the adoption of HiddenMarkov Models (HMM) instead of BLAST alignment. HMM models are constructed for each family of antibiotic resistance genes. And then TC cutoffs are trained with proteins catalogs such as ResFam [12] and PFam [13], where protein families are collected with functional annotations.
Despite the progress on building ARG databases, the lack of universally accepted benchmark hinders the validation of query precision and integration across different references and methods. A previous review [14] that evaluate ARG databases with a small number of known ARG sequences indicates that CARD reports the most number of correct predictions.
The ARG type annotations in these databases are mainly collected from past literatures, and approaches of different databases to report a type of ARG are largely different. In the ideal situation, we hope to have a “golden standard” benchmark that contains test sequences and their reliable ARG type information. However, such universal accepted benchmark is still not available, which makes validation of query precision and integration of different ARG databases remain challenging missions.
However, we can still find insights on potential false cases by dedicated analysis of the specific methods adopted by a certain database. Here we will conduct an indepth inspection of the decision model used by CARD database. Not only the computational methods are described, but also the effects of trained models on certain query data will be analyzed. In result, we spot occasions where the database is likely to make false prediction. Moreover, we will formally describe ambiguous cases due to the logic of the ARG type decision process which merely tests whether a query sequence is sufficiently similar to a single ARG type. After locating and defining the problem, we propose an optimization method on top of current CARD models. The optimization is expected to make the models more coherent with BLAST homology relationships and reduce the expected error rate.
Methods
Inconsistency between CARD models and BLAST homology
To discover ARGs from query DNA sequences, CARD predicts Open Reading Frames from query data using Prodigal [15], and then performs proteinprotein alignment with BLASTP [16]. A critical feature of CARD is that it provides a trained BLASTP alignment bitscore threshold for each type of antibiotic resistance gene. In contrast, other existing databases mainly use an empirical or userset parameter for the discovery of all genes. For example, another popular database Resfinder [17] requires percentidentity and coverage on reference genes as input parameters. The reason the approach of CARD is more appropriate is that ARGs in one category may be almost identical to each other while some categories can contain ARGs with relatively low similarity. We take two types of ARGs which are represented both CARD and Resfinder for illustration – tet(A) [18] and mcr1 [9, 10]. When all sequences of tet(A) in Resfinder are aligned to sequences of the same type in CARD, the mean percent identity is 99.6%. However, for mcr1 the mean percent identity is 47.2%. The degree of similarity inside a type of ARG could be very different, therefore it’s more reasonable to have a specific threshold for a specific type of ARGs. However, the flexible models could give type classifications that are not coherent with BLAST alignment homology relationships. Since the model only considers whether the bit score passes the threshold of a single ARG type, it can happen that the type classification of a query sequence is not the best BLAST hit. For example, if ARG type A reports higher bit score than type B for a given query sequence, but the pretrained threshold of A is much higher than B, then type B could be chosen instead of A. Since BLAST alignment serves as a generally accepted method to evaluate the similarity between genome sequences, we consider the occurrences of incoherence to BLAST homology to be ambiguous cases that need special attention.
Ambiguity in RND efflux pumps
RND efflux pumps [19] are a superfamily of transporters that have garnered intensive research efforts. Studies have revealed that they play critical roles in the development of multidrug resistance in various kinds of bacteria. In CARD databases, a series of ARG types in this family are presented. We notice that one gene (adeF) in this family is given a relatively low threshold – bit score 750 which allows sequences lower than 50% identity to be reported as an instance of this type. However, other genes mainly require much higher identity. MexF, another ARG in RND family, requires bit score 2200, which only allows almost totally identical sequence to be reported. Since genes in the RND family can display a certain level of homology even though they belong to different subtypes, ambiguous cases described in the last section are likely to occur. This can be clearly demonstrated with the help of ARG sequences in SARG [7], another ARG databases that contain ARG protein sequences in the RND family. There are over 300 protein sequences with MexF annotation in SARG. We align these sequences to CARD databases. In result, the MexF entry in CARD is certainly the best BLAST alignment hits for these sequences. However, they will be classified to adeF under the curated model of CARD since their bit score does not reach the threshold of MexF. Instead, their bit score to the adeF entry exceeds the threshold of the ARG type so that MexF sequences in SARG are all classified to the adeF entry by the CARD model.
Describe ambiguity in CARD database
To describe and quantify the ambiguity inside the classification model of CARD in a systematic manner, we define FNambiguity and Coherenceratio.
First of all, we have several basic variables:
 1)
N_{i} = the number of prevalence sequences that can align to ARO entry A_{i}
 2)
C_{i} = the number of sequences that are currently classified to entry A_{i}
Then we define two indicators with the pretrained bitscore cutoff. One is potential FalseNegatives for some ARO entries, which we would like to reduce, and Coherenceratio with respective to BLAST besthits which we intend to maximize.
 A)
FNambiguity:
If a prevalence sequence S_{i} not annotated to the ARG A_{j} has (bitscore, percent identity) both larger than another sequence S_{k} which is annotated to the ARG, then S_{i} is potential FN for this ARO. Let M_{j} = the number of such potential FN sequences, we have:
Also, we say that each such (S_{i}, S_{j}) is an FNambiguous pair for ARO A_{j}.
For each potential FP sequence S_{i} respect to ARO entry A_{j}, K_{i} = the number of sequences with lower (bitscore, identity) than S_{i} and annotated to G_{j.} We can calculate the probability of the occurrence of FNambiguous for an ARO A_{j} by:
In the worst case, each of the sequences not annotated to the entry (NC) has (bitscore, identity) larger than all sequences annotated to the entry (C), then P = 1.
In the above example of MexF the FNratio is 0.79%, with P_{FNambiguous pair} at 0.07%. Over the whole database, the mean (sequenceambiguityratio, pairambiguityratio) is (3.1, 1.6%). We can see in Fig. 1 that both ratios gather below 5% with a smaller number of exceptions. Ratio coordinates of MexF, adeF, and entries with exceptionally high ratios are shown in Fig. 2.
 B)
Coherence Ratio:
For a prevalence sequence S_{i}, suppose its besthit ARO entry Ai (the entry with the highest BLASTP alignment bitscore. If current ARG type annotation of Si is also Ai, we say S_{i} is a coherent instance for A_{i}. Let the number of coherent instances for A_{i} be TP_{i}, and the total number of sequences with A_{j} as the besthit ARO be B_{j}, we define:
Since BLAST is the most wellestablished software to measure the homology between sequences, it’s reasonable to evaluate the coherence of the homology relationships given by CARD ARG models and BLASP alignment. We see that in many occasions that the ARG type annotation of the prevalence sequence is not its besthit ARO entry. Take MexF (ARO: 3000804) mentioned in previous experiments as an example (Fig. 3). We see a large portion of prevalence sequences with MexF as their besthits but annotated to adeF (red points in figure).
Since BLAST is the most recognized tool for evaluating homology between sequences, it’s preferable for the ARG identification models to be more coherent with the homology relationship according to BLAST. Therefore, we will seek to annotate more sequences to its best hit ARO entry. For the above example, it means to “recolor” all or a portion of red points (currently annotated to adeF) to MexF. However, the type change may cause an increase in the number of potential FalseNegative in the space of adeF, shown in Fig. 4. To reflect the tradeoff between, we set our objective function to be:
where A_{i} is the number of sequences currently annotated to A_{i,} S is the total number of sequences.
In the next section, we will show how we can largely elevate the coherence ratio while keeping FNratio in a significantly smaller scale.
Resolve ambiguity by recoloring with support vector machine
Given a set of query sequences S, we align them to the representative sequences of all ARO entries in CARD database. For each sequence S_{i}, only the best hit with both highest bitscore and highest percentidentity is kept. If the besthit ARO A_{i} of a query sequence is different from the ARO A_{j} assigned by the CARD model, we include this sequence to the “Problem Set” of A_{i} (denoted by PS_{i}). The key point of this step is: when sequences in the problem set are aligned to two similar ARO entries, we view Align_ARO_A_{i} (S_{i}) as a transform from sequence to 2Dcoordinates space (Percent Identity, Bitscore). For the same set of sequences, if in the transformed space Align_ARO_A_{i} (S_{i}) they are clearly distinguished with other negative hits, but in another space they are mixed together, then it’s reasonable to think that the set of sequences are true positive of A_{i} instead of A_{j}. We can illustrate the argument with the problem set of ARO entry cmeB, which are annotated to adeF (Fig. 5). In the space of cmeB, the best hits of the red points are cmeB but they are annotated to adeF since bitscore cutoff of cmeB set by CARD is much higher than that of adeF. However, when we observe the problem set with the negative hits with respect to either space, we can see that in cmeB space, the problem set is clearly above negatives but in adeF space there are negatives both above the below the problem set. Therefore, it’s reasonable to say these sequences are potential false positive of adeF and true positive of cmeB.
To quantify how far the problem set are divided with the negatives, we compute a support vector machine (SVM) in each space. The idea to use SVM is inspired by the clear lineardivisibility between a part of the problem set and the whole negatives of MexF (Fig. 6). In this situation, it’s reasonable to believe that the upperright part of the problem set are not negatives of MexF (currently they are classified to adeF) and thus should be recoloring to MexF.
Here SVM serves as a measurement for the divisibility of points of different classes in a space. There is an established computational method for evaluating such divisibility of an SVM in python scikitlearn package, namely Platt scaling. The mean probability of the prediction on all these points can be calculated by Platt scaling. The probability computed in this way increases when the point moves away from the division line of the SVM, thus it could be used to determine which space is a better transform.
f(x) = wx + b is the division line of the SVM, and A, B are parameters trained from the prediction data by Plat scaling.
If the space of current ARO (adeF in the above case) of the problem set reports lower Platt probability, we will recolor the portion of problem set above the division line of SVM (Fig. 7) to the ARO of the best hits and update the cutoff of both AROs to their updated lowest bitscore and lowest percent identity. For cmeB where a SVM with high divisibility is computed, we use the decision function of SVM as an extra cutoff method.
Besides cmeB, there are ten other ARO entries with their problem sets containing more than 50 sequences annotated to adeF. These ARO entries are {‘ceoB’, ‘mexY’, ‘cmeB’, ‘mexQ’, ‘mdsB’, ‘oqxB’, ‘MexB’, ‘MexF’, ‘acrD’, ‘adeB’, ‘acrB’, ‘AcrF’}. We compute their problem sets, and then evaluate in which space these sequences are better divided with the negatives compared with adeF. We plot situation of acrB vs. adeF in Fig. 8. In this case, the predicted logprobability of the SVM for acrB is lower than the SVM for adeF, and we can also see from the 2dcoordinates that red points and gray points sequences in acrB displays tendency to mix with each other. Thus, we won’t consider recoloring the problem set of acrB.
In contrast, we can see a clear division between a large portion of the problem set of MexF and its negatives (Fig. 7). After computing the SVM, the righthand portion of the problem set will be recolored to MexF.
Formulation of categorical optimization problem
The last section demonstrated that we can increase the coherence with BLAST homology relationships while maintaining low FN ambiguous rate by “recoloring” a part of sequences. However, the above transform is more an empirical trial than a systematic optimization. Therefore, in this section we will formulate a categorical optimization problem [20] for the recoloring process between two spaces  a fixed “origin” space (adeF in our problem instance) and another “alternative space” (MexQ, MexF, etc). For a set of protein sequences G [1..N], we define a categorical variable X_{i} ∈{O, A, null (neither of the two types)} for G_{i} representing its ARG category classification. Every assignment of X[1..N] is called a “configuration”. The initial configuration is the SVM result in the last section. We have discussed that recoloring a sequence from the origin (adeF) to the alternative (MexF) may increase the coherence ratio of the alternative (MexF) space but add ambiguity to the origin (adeF) space. Suppose P of type O has higher (Percent Identity, Bit Score) than some sequences of type origin. If P is recolored to another type, then there should be a penalty to the confidence of those sequences.
For computational efficiency, we divide the Percent Identity – Bit Score map to a grid of M × N equalsized cells. A point in the cell (x, y) in the origin space with type A will impose one unit of penalty to all points of type O in its leftdown region excluding the cell itself. Let n_{o} be the number of type O points in the rectangle (0,0,x1,y1), N_{O} (N_{A}) be the total number of type O(A) points. For each type A point (x,y) we have:
Penalties of all type A points are added and normalized to get the total penalty on the origin space:
To make the optimization problem more reasonable in the biological meaning, we add an extra restriction such that the alternative space remains lineardivisible, as drawn in Fig. 7. Formally speaking, we require that there exists a line Y = aX + b in the alternative space such that the points of type A are all above the line. We intend to compute the slope and intercept of the optimal division line w. Therefore, our final objective function to maximize is:
Higher coherence indicates high potential sensitivity for A while higher penalty means potential wrong classification. Therefore, we tend to give larger weights to the later term since usually we prioritize preventing false results. However, the specific value of k depends on the need of the application and also the specific ARG type that we are concerning. Here we use MexQ to set a valid range of k, and then explore the results on MexF for k in that range. The reason we choose MexQ to set the range is that it gives the highest probability calculated by Platscaling in the last section, which means the problem set and the negatives of MexQ are already welldivided in the space so that we can trust the initial configuration of MexQ as the answer. Therefore, k is set to be in (1100) so that the initial configuration for MexQ is optimal.
Results
Results of recoloring with support vector machine
The final prevalence sequences that are classified to adeF are shown in Fig. 9 below. For the objective function L, the sum of coherence ratio is elevated by nearly 80% and the FNratio increased by less than 20%. And the coherence ratio is much larger than FNratio before or after. L value for each step of recoloring is plotted in Fig. 10. The coherence ratio rises from 56.5 to 88.4% and the FNratio increases little from 3.3 to 3.8%. Consequently, we increase L value from 53.1 to 84.5%.
Results of solving categorical optimization problem
To solve the optimization problem, we simply apply the MonteCarlo exploration of neighborhood configurations by randomly adjusting the slope and the intercept. By the SVM process in the last section, we have initial (slope_{0}, intercept_{0}) = (− 71.7, 6947.5). Exploring the optimal configurations for MexF under k values in (1100), we discover that the k = 24 as the boundary for extremely different behaviors. When k is larger than 24, the penalty term always outweighs the coherence, therefore the result is the less MexF points the better. When k does not exceed 24, the optimal points tend to fall along a line. This will be illustrated by plotting f(a,b) for k = 10,24,50 in Figs. 11, 12, 13. Notice that in all these figures (x,y) denotes the point at (slope_{0}  x, intercept_{0} + 50y) and upleft means more points assigned to MexF. For b) parts of these 3 figures, red stands for optimal points and gray are their projection onto the ground to show their coordinates clearly. We see that k = 10 and k = 24 behave similarly through optimal points when k = 10 have more MexF points.
Discussions
CARD is a comprehensive antibiotic resistance database that provides over 2000 types of ARG entries organized in a hierarchy of gene ontology terms, together with the corresponding resisted drug classes. Moreover, the model curated from published literatures for each type of ARGs and the prevalence data are now a precious resource for researchers to know about the degree of variation among sequences in the ARG types of interest. Although we have not settled a reliable benchmark to verify the precision of an ARG discovery method, it’s already important to discover that some ARG types contain a very similar set of sequences while some others do not behave in the same way. Moreover, through indepth analysis of approaches and effects of the classification model used by CARD, we discover ambiguous cases when sequences are aligned to ARGs of closely related types, namely RND efflux pump superfamily, which is a family of ARGs with crucial clinical importance. The decision model of CARD only considers one target ARG type at a time, which causes frequent occurrences of incoherence with BLAST homology relationships.
Through an empirical recoloring experiment, we discover that by adjusting the linear decision function of some ARG types, the occurrences of ambiguity could be reduced. And then such repairment process is formulated as a categorical optimization problem, where randomized algorithms are applied to obtain the solution to minimize the probability of ambiguous cases. Currently the formulation is limited to solve optimization of just two spaces. We look forward to developing models and solutions to consider multiple ARG types in the same family.
Conclusions
In this article, we reviewed stateofart antibiotic resistance gene databases and revealed ambiguous cases from the decision model of CARD. After formally defining metrics to quantify the ambiguity within CARD database, we propose recoloring with support vector machine and categorical optimization techniques to resolve the problem.
The method we raised is currently a prototype and subject to verification of more data with highconfidence annotation. Due to the rapid mutation of the pathogen genome, novel antibiotic resistance genes are keeping submitted by entities all over the globe. Therefore, the answer to our problem is deemed to be continuously dynamic. We look forward that this article can serve as a meaningful step to a systematic approach for comparing, filtering and integrating ARG reports across different reference databases.
Availability of data and materials
The data used in this article come from the following public available antibiotic resistance gene databases:
1. ARGs and prevalence data in CARD database, https://card.mcmaster.ca/download/0/broadstreetv3.0.2.tar.gz [6].
2. Resfinder ARG database, https://bitbucket.org/genomicepidemiology/resfinder_db.git/ [17].
3. SARG database: https://galaxyproject.org/use/argsoap/ [8].
Abbreviations
 ARG:

Antibiotic resistance gene
 ARO:

Antibiotic resistance ontology (an entry of ARG in CARD)
 BLAST:

Basic Local Alignment Search Tool
 CARD :

Comprehensive Antibiotic Resistance Database
 RND:

Resistancenodulationcell division
 SARG:

Structured ARG reference database
 SVM:

Support vector machine
References
 1.
Ventola CL. The antibiotic resistance crisis: part 1: causes and threats. Pharm Ther. 2015;40(4):277.
 2.
Mazel D, Davies J. Antibiotic resistance in microbes. Cellular and Molecular Life Sciences CMLS. 1999;56(9–1)0:742–754.
 3.
ROCA Ignasi, et al. The global threat of antimicrobial resistance: science for intervention. New microbes and new infections. 2015;6:22–29.
 4.
Zankari E, et al. Genotyping using wholegenome sequencing is a realistic alternative to surveillance based on phenotypic antimicrobial susceptibility testing. J Antimicrob Chemother. 2012;68(4):771–777.
 5.
Liu B, Pop M. ARDB—antibiotic resistance genes database. Nucleic acids research. 2008;37(suppl_1):D443–D447.
 6.
Amogelang R R, Pawlowski, Andrew C, Sharma AN, Jia B, Dave BM, Alcock B, Lago BA, Sardar D, Westman EL, Wright GD, Tsang KK, Waglechner N, Guo P, Doshi S, Pereira S, Johnson TA, Mcarthur AG, Brinkman FSL, Courtot M, Lo R, Frye JG, Williams LE, Tariq YE. CARD 2017: expansion and modelcentric curation of the comprehensive antibiotic resistance database. Nucleic Acids Res. 2016;45(D1):D566–73. https://doi.org/10.1093/nar/gkw1004.
 7.
Li L, YIN X, Jiang XT, Zhang T, Chai B, Cole JR, Tiedje JM, Ying YY. ARGsOAP v2.0 with an expanded SARG database and Hidden Markov Models for enhancement characterization and quantification of antibiotic resistance genes in environmental metagenomes. Bioinformatics. 2018;34(13):2263–70. https://doi.org/10.1093/bioinformatics/bty053.
 8.
Yang Y, Jiang X, Chai B, Ma L, Li B, Zhang A, Cole JR, Tiedje JM, Tong YZ. ARGsOAP: online analysis pipeline for antibiotic resistance genes detection from metagenomic data using an integrated structured ARGdatabase. Bioinformatics. 2016;32(15):2346–51.
 9.
Liu YY, Wang Y, Walsh TR, Yi LX, Zhang R, Spencer J, Doi Y, Tian G, Dong B, Huang Xianhui Y. OTHERSEmergence of plasmidmediated colistin resistance mechanism MCR1 in animals and human beings in China: a microbiological and molecular biological study. Lancet Infect Dis. 2016;16(2):161–8.
 10.
Hembach, Norman, Schmid, Ferdin Alex, , Er, Johannes, Hiller, Christian, Rogall, Eike T. Y Schwartz Thomas. "Occurrence of the mcr1 Colistin Resistance Gene and other Clinically Relevant Antibiotic Resistance Genes in Microbial Populations at Different Municipal Wastewater Treatment Plants in Germany". Front Microbiol. 2017, vol 8, p. 1282.
 11.
Sun J, Xu Y, Gao R, Lin J, Wei W, Srinivas S, Liu YH. Deciphering MCR2 colistin resistance. MBio. 2017;8(3):e00625–17.
 12.
Gibson MK, Forsberg KJ, Dantas G. Improved annotation of antibiotic resistance determinants reveals microbial resistomes cluster by ecology. ISME J. 2015;9(1):207.
 13.
Finn RD, et al. Pfam: the protein families database. Nucleic Acids Res. 2013;42(D1):D222–30.
 14.
XAVIER, Basil Britto, et al. Consolidating and exploring antibiotic resistance gene data resources. J Clin Microbiol. 2016;54(4):851–859.
 15.
HYATT, Doug, et al. Prodigal: prokaryotic gene recognition and translation initiation site identification. BMC bioinformatics. 2010;11.1:119.
 16.
Ye J, Mcginnis SY, Madden TL. BLAST: improvements for better sequence analysis. Nucleic Acids Res. 2006;34(suppl2):W6–9.
 17.
Zankari E, Hasman H, Cosentino S, Vestergaard M, Rasmussen S, Lund O, et al. Identification of acquired antimicrobial resistance genes. J Antimicrob Chemother. 2012;67(11):2640–4. https://doi.org/10.1093/jac/dks261.
 18.
Roberts MC. Update on acquired tetracycline resistance genes. FEMS Microbiol Lett. 2005;245(2):195–203.
 19.
SUN J, DENG Z, YAN A. Bacterial multidrug efflux pumps: mechanisms, physiology and pharmacological exploitations. Biochemical and biophysical research communications. 2014;453(2):254–267.
 20.
Lindroth, Peter Y Patriksson, Michael. Pure categorical optimization: a global descent approach. Chalmers: Department of Mathematical Sciences, Division of Mathematics; 2011.
Acknowledgments
Not applicable.
About this supplement
This article has been published as part of BMC Genomics Volume 20 Supplement 10, 2019: Proceedings of the Joint International GIW & ABACBS2019 Conference: genomics. The full contents of the supplement are available online at https://bmcgenomics.biomedcentral.com/articles/supplements/volume20supplement10.
Funding
This project is partially supported by the Areas of Excellence Scheme (AoE/M403/16) of the HKSAR, which will also cover the publication cost.
Author information
Affiliations
Contributions
HY collected the data, implemented the analysis procedures and wrote the manuscript. SMY proposed the project, designed the experiments and supervised this study. Both authors have read and approved the final version.
Corresponding authors
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Yao, H., Yiu, SM. Deep analysis and optimization of CARD antibiotic resistance gene discovery models. BMC Genomics 20, 914 (2019). https://doi.org/10.1186/s1286401963185
Received:
Accepted:
Published:
Keywords
 Antibiotic resistance gene
 CARD database
 RND efflux pumps