Patent Publication Number: US-2023135480-A1

Title: Molecular technology for detecting a genome sequence in a bacterial genome

Description:
FIELD OF THE INVENTION 
     The present invention relates to the technical field of molecular biology applied to bacterial genomics, and in particular to the field of predicting phenotypic traits of bacteria from their genomes. The invention is particularly applicable to the prediction of antibiotic susceptibility and virulence of bacteria present in a biological sample. 
     PRIOR ART 
     A. Molecular Technology for Phenotype Prediction 
     The susceptibility of a bacterial strain to an antibiotic, i.e. its sensitivity or resistance in the context of a treatment based on the antibiotic administered to a human or an animal, cannot be directly observed by a human being. Specifically, direct observation of the strain, even using microscopes, does not make it possible to determine its behavior toward the antibiotic. in vitro diagnosis in a bacterial context consists, by nature, in making this phenotypic nature observable and therefore ultimately exploitable for a clinician. During the 20th century, in vitro diagnostic technologies essentially combined culture-based sample preparation techniques, notably to make the bacterial strains present in the samples visible and manipulable, and techniques for optical measurement of the behavior of the strains in the presence of an antibiotic. For example, a conventional microbiology laboratory workflow involves first spreading a sample from a patient suspected of having a bacterial infection on a culture medium to produce bacterial colonies that are visible to a human operator or an automated system after incubation. In a second stage, when the colonies are large enough, a technician or an automated system takes a colony, mixes it with an antibiotic at different concentrations and introduces the mixtures into a device that measures the optical density of each mixture and deduces therefrom the susceptibility to the antibiotic. Since the optical density indicates the bacterial proliferation, it unambiguously characterizes the sensitivity or resistance of the bacterium: if the density increases, this means that it is proliferating despite the presence of the antibiotic, and thus that it is resistant to the antibiotic at the concentration of the antibiotic under consideration. 
     Today, the combination of sample preparation technologies and optical density-based measurement technologies has significant limitations in the face of rapid global development in the prokaryotic kingdom, namely the acquisition of multi-drug resistance to antibiotics, which is estimated to be responsible for more deaths than cancer by 2050. First of all, these technologies are not agnostic as regards bacteria. Specifically, depending on the chosen culture medium, certain strains will grow and others will not, and as such these technologies do not make it possible to characterize the antibiotic susceptibility of all bacterial species. Secondly, these techniques are extremely slow since they are based on bacterial culturing that takes a long time. Thus, obtaining an antibiogram of a bacterium takes at least 30 hours from the time the sample is taken. This delay does not allow effective treatment of patients who are systematically given a broad-spectrum antibiotic cocktail as a first-line treatment. In addition to the consequences for the patient, this inappropriate and massive administration of antibiotics reinforces the selection pressure of multi-drug-resistant bacteria and thus contributes toward their expansion. It is thus believed at the present time that conventional in vitro diagnostic technologies are increasingly unsuitable for treating patients and are, to a certain extent, one of the reasons for the emergence of multi-drug resistance. 
     The maturation of molecular biology technologies, in particular bacterial DNA and/or RNA characterization technologies, such as polymerase chain reaction (PCR), DNA chips or sequencing, is bringing about a paradigm shift in the analysis of antibiotic resistance in laboratories. Firstly, they are more agnostic toward bacterial species. For example, metagenomic technology makes it possible to process bacterial DNA in a biological sample irrespective of the bacterial species present. Secondly, they aim to provide a result in a few hours, with some, such as PCR, even providing a result in less than 20 minutes. On the other hand, molecular techniques for characterizing antibiotic susceptibility are based on genomic signatures (absence/presence of genes, genetic mutations, predictive models, etc.) characterizing said susceptibility.  FIG.  1    illustrates in a simplified and nonlimiting manner two bacterial DNA characterization technologies, namely a PCR technology  10  and a whole genome sequencing (WGS) technology  20  applied in microbiological workflows for the treatment of a patient suspected of having a bacterial infection. Both workflows begin with the collection  12  of a biological sample from the patient, followed by the application of PCR  10  or WGS  20  technology, each yielding a result  106 ,  210  of genomic signatures characterizing susceptibility to one or more antibiotics, on the basis of which result an antibiotic treatment is chosen and administered to the patient by a clinician in  14 . Basically, each of the molecular technologies requires the preparation  102 ,  202  of the sample taken prior to the application of the PCR itself  104 , e.g. a nested PCR performed using a Filmarray platform from the company Biofire, or the application of sequencing  204 , e.g. SBS sequencing performed using a MiSeq platform from the company Illumina. 
     One of the main differences between these two molecular technologies is the nature of the genomic signatures. In the case of PCR, the genomic signature is molecular, and therefore tangible: it is translated into primers introduced into a reaction mixture, these primers specifically targeting bacterial DNA sequences introduced into the mixture, and its detection is generally achieved by measuring an optical signal. In contrast, in the case of WGS, genomic signatures are digital since the sequencing produces a digital genome and the processing of said genome is computerized. Whereas the WGS technology allows, at the very least, the implementation of PCR genomic signatures, it above all allows complex exploitation of the digital genome and the use of predictive models of antibiotic susceptibility that are impossible to implement using PCR technologies. Thus, the WGS technology is advantageously based on a computer design of the genomic signatures  30 , this design advantageously exploiting large genomic and phenotypic knowledge bases with the aid of complex analytical tools, for example machine learning technologies such as parsimoniously constrained logistic regressions. 
     This being the case, all molecular techniques are based on the same technical foundation, namely the measurement of genomic information from bacterial strains and the processing of said information so as to extract information regarding the behavior of the strains in the presence of an antibiotic. Moreover, while these computer technologies, and more particularly those of sequencing, are different in nature from those associated with optical density analysis of more conventional microbiological technologies, they do not change the technical nature of the in vitro diagnosis they perform. For example, in the case of infectious diagnostics, it is still a matter of applying technologies for processing a biological sample so as to determine whether a patient has a bacterial infection and to know the behavior of the infectious bacterium in the presence of an antibiotic in order to administer an appropriate antibiotic treatment. 
     B. Interpretability Of Molecular Technologies for Phenotype Prediction 
     Focusing more particularly on genomic signatures, the first approaches consisted in identifying previously identified antibiotic resistance markers in the bacterial genome, referred to as “direct association” approaches. While these approaches are effective when the genetic mechanisms leading to resistance are well known and simple, as is the case for most resistance mechanisms in species such as  Mycobacterium tuberculosis , they suffer from major limitations: incomplete knowledge of resistance mechanisms in many species and antibiotics, resulting, for example, in incomplete databases, difficulty in taking into account differences in the predictive powers of markers and the multifactorial aspect of antibiotic susceptibility (e.g. 
     epistasis, combination of multiple mutations, etc.), etc. Faced with these difficulties, the genetic determinism of antibiotic susceptibility is being addressed more effectively by new approaches based on advanced computer technologies, and in particular by supervised machine learning technologies, the learning and application architecture of which can be summarized as follows:
         A. for a set of learning bacterial strains:
           a. each strain is sequenced and phenotypically characterized (e.g. measurement of its minimum inhibitory concentration and/or measurement of its susceptibility—resistance, intermediate or sensitive—to one or more antibiotics);   b. a computer model for predicting the susceptibility to the antibiotic is trained from genomes and phenotypic data.   
           B. for a new strain whose susceptibility to an antibiotic from step (A. a) is sought:
           a. the strain is sequenced;   b. the computer prediction model is applied to its digital genome so as to determine its susceptibility.   
               

     The above generic description involves first defining the machine learning variables that describe the bacterial genome. There are many ways to describe said genome, one of them being the description in “k-mers”, i.e. the list of nucleic acid sequences of length k (i.e. number of bases) constituting the genome. As described in M. Jaillard Dancette&#39;s thesis, “Vers une cartographie des polymorphisms liés à la résistance aux antimicrobiens [Toward a mapping of polymorphisms related to antimicrobial resistance]”, 2018, this description is particularly suited to bacterial genomes which are haploid and highly plastic compared to eukaryotic genomes. In other words, this description effectively describes the diversity of genetic mechanisms underlying antibiotic susceptibility in bacteria. 
     However, this description has a number of drawbacks that may have a negative impact on machine learning technologies, including the following:
         a. k-mers are highly redundant: those covering a conserved genomic region can be co-occurring, i.e. present or absent in a systematic manner in a set of genomes, and are therefore statistically equivalent;   b. some k-mers are not specific to a genomic region and as such they are difficult to annotate, i.e. to characterize structurally or functionally (gene, mutation, etc.);   c. the genome-susceptibility association is a very high-dimensional problem, the number of k-mers per genome being greater than a hundred thousand or even a million, and as such redundancy and non-specificity lead to highly correlated variables for the learning tools.       

     For high-risk fields, particularly that of human health, it is important to reduce the dimensionality of the variables to increase the interpretability of prediction models. Specifically, machine learning tools are sensitive to biases in the learning data, for example lack of genomic diversity, and to biases associated with an incomplete formulation of susceptibility as a function of the bacterial genome, for example failure to take into account strong correlations between different genomic regions. By reducing the dimensionality, prediction models become easier to interpret for both learning tool experts and bacterial genomics experts, enabling biases to be detected and thus enabling the construction of appropriate learning data or reformulating the problem that the learning tool is intended to solve. Similarly, since they are more interpretable, prediction models are easier to validate for use in a high-risk field if no biases are apparent after their analysis. 
     Among the tools that allow a strong reduction in dimensionality, parsimonious automatic learning tools, for instance penalized lasso regressions or decision tree-based tools, make it possible to obtain a number of predictive k-mers, i.e. k-mers that are retained in the prediction model, of the order of a thousand or even a hundred. However, these tools are unstable in a high-dimensional environment in which the variables are highly correlated. Thus, they can select predictor variables that together form a genomic unit that does not necessarily have any biological reality, and as such the prediction models remain difficult to interpret. Certain techniques can take into account strong correlations between variables, notably elastic-net penalty-based regressions which combine L1-type penalties with L2-type penalties, leading to the selection of groups of correlated predictor variables. It should be noted, however, that this clustering remains mainly algorithmic and that the groups of variables retained are still difficult to interpret biologically. 
     Other tools, for instance group-lasso tools, enable the a priori clustering of descriptive variables into genomic units. In this context, all the variables in a unit are either predictive or not, depending on the selection or non-selection of the unit by the group-lasso strategy. However, since the description in k-mers is difficult to interpret for the reasons mentioned above, the a priori definition in explanatory units is difficult. In particular, this assumes that high correlation phenomena in a high-dimensional space are well understood and formalized by experts in bacterial genomics, since a lack of knowledge, or imperfect knowledge of these phenomena, translates into bias in the machine learning algorithm. 
     C. Application of Molecular Prediction Technologies to Biological Variability 
     In parallel to the problem presented above, when a prediction is based on groups of genome sequences, the question arises as to whether a group is present in the genome of a strain if all the sequences that make up the cluster are all present in the genome in an identical manner. If such a criterion is applied, it assumes that the learning data are complete to encompass all the genomic variability of the bacterial species. In addition to the fact that it is difficult to judge the completeness of the learning data at a given time, said data very often become incomplete over time in certain bacterial species due to the very significant plasticity of their genome. Also, the application of a criterion that is too strict leads to a high rate of false positives or false negatives. 
     Furthermore, the sequenced genome can be tainted with error, notably when it is in the form of “reads”, i.e. sequences produced at the output of sequencing platforms before any bioinformatics processing such as concensus assembly or filtering of poor-quality reads. In this case, a sequence, although present in the genome, may be detected as absent due to sequencing errors and vice versa. In particular, bioinformatics processing generally includes filtering of low-quality reads, and optionally concensus assembly of the filtered reads to obtain assembled sequences, or “contigs”. The optional nature of the assembly generally depends on the context in which the sample analysis is performed. The effect of assembly is to significantly reduce sequencing errors in the contigs, at the present time to a level of 10 −5  for SBS technologies used in the platforms of the company Illumina Inc., and to a level of 10 −2  for nanopore technologies used in the platforms of the company Oxford Nanopore Technologies Ltd. On the other hand, since assembly requires high computing power and time, it is not very well suited to “POC” (point of care) genomic applications where the computing environment is generally not very powerful and/or to fast, or even real-time applications. In this context, genomic analysis, for example to determine the identity of the one or more species present in the sample and/or their susceptibility to one or more antibiotics as described previously, is performed directly on the filtered or unfiltered reads. However, sequencing errors are of the order of 2 to 3% for SBS technologies and up to 12% for nanopore technologies. Without special precautions, genomic analysis can lead to an equally high error rate. 
     The problems which have just been described in relation to the genomic prediction of the susceptibility of a bacterial strain to one or more antibiotics arise in the same terms for any genomic determination of a phenotypic trait of the strain, for example its virulence or its ribotype. 
     DESCRIPTION OF THE INVENTION 
     The purpose of the present invention is to provide a robust detection of the presence or absence of a genome sequence in a genome of a microorganism, notably of a bacterial strain, a yeast strain or a mold strain. 
     To this end, one subject of the invention is a computer-assisted process for detecting a genome sequence in digital form in a genome of a microorganism in digital form, the process involving:
         storing in a computer memory a set of digital genome sequences of constant length k, or “k-mers”, said set being obtained by sliding, with a constant step, a window of length k over the genome sequence;   for each k-mer, determining its absence or presence in the genome;   determining that the genome sequence is present in the genome if the percentage of k-mers detected as being present in the genome is above a predetermined threshold.       

     According to one embodiment, the determination of the presence or absence of a k-mer in the genome is obtained by detecting at least one identical copy of the k-mer in the genome. 
     In particular, the digital genome consists of a set of genome sequences produced by a sequencing platform, or “reads”, and according to which the determination of the presence or absence of a k-mer in the genome is obtained by detecting N cov  identical copies of the k-mer in the genome, where the integer N cov  is equal to: 
     
       
         
           
             
               N 
               cov 
             
             = 
             
               τ 
               × 
               
                 
                   N 
                   r 
                 
                 
                   N 
                   g 
                 
               
             
           
         
       
     
     where: N r  is the total number of bases included in the digital genome, N g  is the total number of bases of a reference genome of the species to which the microorganism belongs, and τ is a percentage between 5% and 15%, in particular 10%. 
     In particular, the genome of the microorganism is included in a set of genomes derived from the direct sequencing of a sample, each digital genome consisting of a set of genome sequences produced by a sequencing platform, or “reads”, and according to which the determination of the presence or absence in the genome is obtained by detecting N cov  identical copies of the k-mer in the genome, where the integer N cov  is equal to: 
     
       
         
           
             
               N 
               cov 
             
             = 
             
               τ 
               × 
               ρ 
               ⁢ 
               
                 
                   N 
                   r 
                 
                 
                   N 
                   g 
                 
               
             
           
         
       
     
     where: N r  is the total number of bases included in the digital genome, N g  is the mean total number of bases of a genome of the species to which the microorganism belongs, ρ is the relative proportion of the microorganism in the sample, is the percentage and τ is a percentage between 5% and 15%, in particular 10%. 
     According to one embodiment, the predetermined threshold is dependent on the length of the genome sequence. In particular, said predetermined threshold value decreases with the value of the length of the genome sequence. 
     Preferably, the space of the genome sequence lengths is divided into three intervals, and according to which the predetermined threshold takes a single value per interval. In particular, k is between 15 and 50, and according to which if L≤61 then s uni =90%, if 61&lt;L≤100 then s uni =80% and if 100&lt;L then s uni =70%, in which L is the length of the genome sequence and s uni  is the predetermined threshold value. 
     According to one embodiment, the detection of a group of genome sequences is provided, said detection involving:
         detecting each genome sequence of said group in accordance with a process as claimed in one of claims  1  to  9 ;   determining that the group of genome sequences is present in the genome:
           if at least one genome sequence of said group is detected; or   if all the genome sequences of said group are detected; or   if the percentage of genome sequences of said group that are detected is above a second predetermined threshold; or   with a probability equal to the percentage of genome sequences of said group that are detected as being present.   
               

     In particular, the second threshold is greater than or equal to 20%, preferably equal to 25%. 
     According to the embodiment, the process also comprises the total or partial sequencing of the genome of the bacterial strain so as to produce the genome in digital form. 
     A subject of the invention is also a computer program product storing computer-executable instructions for performing a process of the abovementioned type. 
     A subject of the invention is also a system for detecting a genome sequence in a genome of a microorganism, comprising:
         a sequencing platform for the partial or total sequencing of the genome of said strain;   a computer unit configured to apply a detection process as claimed in any one of claims  1  to  10 .       

    
    
     
       BRIEF DESCRIPTION OF THE FIGURES 
       The invention will be better understood on reading the following description, which is given purely by way of example, and made in relation to the appended drawings, in which identical references denote identical or similar elements, and in which: 
         FIG.  1    illustrates two molecular technologies of the prior art for predicting the susceptibility of a bacterial strain to an antibiotic; 
         FIGS.  2 A and  2 B  are flow charts of a learning phase and a prediction phase according to the invention; 
         FIG.  3    illustrates MAF unit generation according to the invention; 
         FIG.  4    illustrates a clustering used in the process according to the invention; 
         FIG.  5    is an ROC curve illustrating the selection of a prediction threshold according to the invention; 
         FIG.  6    illustrates, for the bacterial species  Klebsiella pneumoniae  and the antibiotic meropenem, the coefficients of a prediction model obtained according to a lasso technique and according to the process of the invention, named “cluster-lasso”, and also the location of the predictive variables of two lasso and cluster-lasso models in the sub-graph of the compacted graph annotated as being blaKPC gene; 
         FIG.  7    illustrates, for the bacterial species  K. pneumoniae  and the antibiotic cefoxitin, the subgraph(s) of the compacted graph involving the most predictive extended MAF units of the lasso model (left part), and the subgraph(s) of the compacted graph involving the most predictive clusters of the cluster-lasso model (right-hand part); 
         FIG.  8    illustrates, for the species  Salmonella  and for the antibiotic tetracycline, the absolute values of the coefficients of the lasso model, the absolute values of the coefficients of the cluster-lasso model, and the number of unitigs included in the first 10 most predictive clusters of the cluster-lasso model; 
         FIG.  9    illustrates, for the species  Salmonella  and for the antibiotic tetracycline, the subgraph(s) of the compacted graph involving the most predictive extended MAF units of the lasso model (left part), and the subgraph(s) of the compacted graph involving the most predictive clusters of the cluster-lasso model (right-hand part); 
         FIG.  10    shows, for the species  Salmonella  and for the antibiotic gentamicin, the absolute values of the coefficients of the lasso model, the absolute values of the coefficients of the cluster-lasso model, and the number of unitigs included in the first 10 most predictive clusters of the cluster-lasso model; 
         FIG.  11    illustrates, for the species  Salmonella  and for the antibiotic gentamicin, the subgraph(s) of the compacted graph involving the most predictive extended MAF units of the lasso model (left part), and the subgraph(s) of the compacted graph involving the most predictive clusters of the cluster-lasso model (right-hand part); 
         FIG.  12    illustrates, for the species  Neisseria gonorrhoeae  and for the antibiotic cefixime, the sub-graph(s) of the compacted graph involving the most predictive extended MAF units of the lasso model (left part), and the sub-graph(s) of the compacted graph involving the most predictive clusters of the cluster-lasso model (right-hand part); 
         FIG.  13    illustrates, for the species  Neisseria gonorrhoeae  and for the antibiotic cefixime, the absolute values of the coefficients of the lasso model, the absolute values of the coefficients of the cluster-lasso model, and the number of unitigs included in the first 10 most predictive clusters of the cluster-lasso model; 
         FIG.  14    illustrates for the species  Staphylococcus aureus  and for the antibiotic tetracycline, the sub-graph(s) of the compacted graph involving the most predictive extended MAF units of the lasso model (left part), and the sub-graph(s) of the compacted graph involving the most predictive clusters of the cluster-lasso model (right-hand part); 
         FIG.  15    shows, for the species  Staphylococcus aureus  and for the antibiotic tetracycline, the absolute values of the coefficients of the lasso model, the absolute values of the coefficients of the cluster-lasso model, and the number of unitigs included in the first 10 most predictive clusters of the cluster-lasso model; 
         FIG.  16    illustrates a flow chart for detecting a genome sequence in a genome; 
         FIG.  17    shows the breakdown of the genome sequence into k-mers; 
         FIG.  18    illustrates the percentages of presence of k-mers in the genome that must be achieved to detect the genome sequence, these percentages being dependent on the length of said sequence; 
         FIGS.  19 A and  19 B  illustrate the AUC of a lasso prediction and a cluster-lasso prediction as a function of the sequencing depth of coverage for  Klebsiella pneumoniae  strain isolates; and 
         FIGS.  20  and  21    illustrate the AUC of a cluster-lasso prediction as a function of the sequencing depth of coverage of metagenomic sample comprising  Klebsiella pneumoniae  strains. 
     
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     A. Embodiment of the Invention 
     With reference to  FIGS.  2 A and  2 B , a process according to the invention includes a first part  30  of training a model for predicting the susceptibility of a bacterial strain, belonging to a given bacterial species, to an antibiotic as a function of the bacterial genome of said strain, and a second part  40  of applying said model to a strain of said bacterial species to predict its unknown susceptibility. 
     The first part  30  begins by establishing, in  300 , a genomic and phenotypic database for said species. In particular, a set of strains is collected, for example from patients infected with said species, and each collected strain is sequenced to obtain its complete genome, for example using an MiSeq sequencing platform from the company Illumina, and an antibiogram is established to determine its susceptibility to the antibiotic-resistant (“R”), intermediate (“I”) or sensitive (“S”) in accordance with the critical concentrations (or “breakpoints”) of the CLSI standard or the EUCAST standard—for example using a Vitek 2 from the company bioMérieux. Preferably, the genomes take the form of assembled sequences (or “contigs”) produced by digitally assembling digital sequences produced by the sequencing platform (or “reads”) in a manner known per se. The complete digital genome and antibiotic susceptibility of each strain are stored in a computer database to form a learning data set and a test data set. 
     Advantageously, but optionally, the “resistant” and “intermediate” states are merged so as to obtain two antibiotic susceptibility states. In this way, a binary classification problem is defined which distinguishes between sensitive (“S”) bacterial strains and non-sensitive (“NS”) bacterial strains. For example, the S state is coded with the number 0 and the NS state is coded with the number 1. 
     The remainder of step  30  is performed by computer and begins, in  302 , by clustering the database into two, so as to obtain a learning database and a test database. Preferably, the cluster is a “10-fold” cluster, with nine-tenths of the database constituting the learning database and the remaining tenth constituting the test database. The total number of bacterial strains used for the learning database is noted hereinbelow as N. 
     In the next step  304 , a set of descriptive variables of the bacterial genome is determined. With reference to  FIG.  3    in parallel to  FIG.  2   , the genomes G of the learning database are first described in k-mers, in  306 , of size k between 15 and 50, so as to optimally capture the genetic variability of the bacterial species while at the same time limiting the redundancy of the k-mers, for example k=31. In a subsequent step  308 , a transformation of the k-mers into a set of distinct genome sequences, without loss of information, is performed. For this purpose, the k-mers are first transformed into a De Bruijn graph DBG of order k and alphabet A, T, G, C. The DBG graph is then transformed into a compacted De Bruijn graph cDBG by automatically clustering the linear paths, and thus having no branching. The k-mers are thus encoded in a graph whose nodes, which are different from each other, correspond to sequences of variable length, these nodes (and equivalently, these sequences) being called “unitigs”. 
     In a subsequent step  310 , the unitigs are clustered into units by deduplication, the minor allele frequency (MAF) of which units is optionally higher than a predetermined threshold “S MAF ” of between 98% and 99.5%, for example 99%. In particular:
         a. each unitig of the compacted graph cDBG is encoded by a binary variable representing the presence or absence of the unitig in each genome of the database. A matrix V is thus obtained such that its component V i,j  is equal to 1 if the j th  unitig is present in the i th  genome of the database and equal to 0 if it is absent.   b. each vector V .,j  of the matrix V, i.e. each column associated with a unitig, is then corrected for the purpose of calculating an MAF of the unitig. If the allelic frequency of the j th  unitig is greater than 0.5, meaning that it is observed in more than 50% of the genomes in the database       

     
       
         
           
             
               ( 
               
                 
                   
                     i 
                     . 
                     e 
                     . 
                         
                     
                       1 
                       n 
                     
                   
                   ⁢ 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         1 
                       
                       n 
                     
                     
                       V 
                       
                         i 
                         , 
                         j 
                       
                     
                   
                 
                 &gt; 
                 0.5 
               
               ) 
             
             , 
           
         
       
     
     then the column V i,j  is transformed such that ∀i, V i,j =|1−V i,j |. This transformation has the advantage of rendering identical two columns of the matrix V that are initially complementary, so that the presence co-occurrence of unitigs is identical to their absence co-occurrence.
         c. the matrix V thus transformed is then filtered for identical columns in order to group together into units the unitigs of perfect co-occurrence, i.e. those with identical absence/presence of units in the genomes of the database. For example, if the transformed matrix V has its first column V .,1  identical to its second column V .,2  one of the columns is deleted and the remaining column codes for the union of the unitigs of the first and second column, thus forming a new genomic unit;   d. units whose frequency is lower than (100-S MAF )%, i.e. for S MAF =99%, units such that       

     
       
         
           
             
               
                 
                   
                     ∑ 
                     i 
                   
                   
                     V 
                     
                       i 
                       , 
                       j 
                     
                   
                 
                 N 
               
               &lt; 
               0.01 
             
             , 
           
         
       
     
     are then eliminated, implying the deletion of the corresponding column of the matrix V. The result is a matrix X such that its component X i,j  is equal to 1 if the j th  MAF unit is present in the i th  genome of the database, and equal to 0 if it is absent. 
     The remaining units, referred to hereinbelow as the “MAF units”, are unique, different from each other, and are subsequently used as variables in the machine learning tools described below. This clustering into units and filtering significantly reduce the redundancy induced by the description of the genomes in k-mers without modifying the intrinsic information value of the MAF units regarding their possible involvement in antibiotic susceptibility. Steps  304 - 310  are described in greater detail in the thesis by M. Jaillard Dancette, “Vers une cartographie des polymorphismes liés à la résistance aux antimicrobiens [Towards a mapping of polymorphisms related to antimicrobial resistance]”, 2018, and in the article by Jaillard M. et al. “ A fast and agnostic method for genome - wide association studies: Bridging the gap between k - mers and genetic events ”, PLOS Genetics, 2018, and implemented, for example, using the DBGWAS software developed by M. Jaillard (https://gitlab.com/leoisl/dbgwas). 
     The learning part  30  continues with a step  312  of clustering the MAF units into a limited number of variables that are both predictive of antibiotic susceptibility and have enhanced biological significance, referred to hereinbelow as “clusters”. 
     Step  312  begins, in  314 , with the selection of MAF units that are predictive of antibiotic susceptibility. Advantageously, this selection is performed using a penalized logistic regression tool of the LASSO type. More particularly, for each value λ of a set of positive values {λ 1 ,λ 2 , . . . ,λ m }, the following optimization problem is solved: 
     
       
         
           
             
               
                 
                   
                     
                       β 
                       ^ 
                     
                     ( 
                     λ 
                     ) 
                   
                   = 
                   
                     
                       arg 
                       
                         min 
                         
                           β 
                           ∈ 
                           
                             ℝ 
                             
                               p 
                               + 
                               1 
                             
                           
                         
                       
                       
                         
                           ∑ 
                           
                             i 
                             = 
                             1 
                           
                           N 
                         
                         
                           ℒ 
                           ⁡ 
                           ( 
                           
                             
                               y 
                               i 
                             
                             , 
                             
                               f 
                               ⁡ 
                               ( 
                               
                                 X 
                                 
                                   i 
                                   , 
                                   . 
                                 
                               
                               ) 
                             
                           
                           ) 
                         
                       
                     
                     + 
                     
                       λ 
                       ⁢ 
                       
                         
                           ∑ 
                           
                             j 
                             = 
                             1 
                           
                           p 
                         
                         
                           
                             ❘ 
                             &#34;\[LeftBracketingBar]&#34; 
                           
                           
                             β 
                             j 
                           
                           
                             ❘ 
                             &#34;\[RightBracketingBar]&#34; 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   
                     ( 
                     
                       X 
                       
                         i 
                         , 
                         . 
                       
                     
                     ) 
                   
                   = 
                   
                     
                       β 
                       0 
                     
                     + 
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         p 
                       
                       
                         
                           β 
                           j 
                         
                         ⁢ 
                         
                           X 
                           
                             i 
                             , 
                             j 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
     in which relationships:
         p is the number of MAF units, and thus the number of columns in the matrix X;   N is the number of bacterial strains used to make the learning database, and thus the number of rows in the matrix X;   y i  is the susceptibility to the measured antibiotic of the i th  bacterial strain, associated with the i th  row of the matrix X, i.e. y i =0 if said strain is sensitive and y i =1 otherwise;      is a logistic loss function, quantifying the difference between the measured phenotype y i  and the predicted phenotype f(X i,. ), for example a squared difference of these two terms or a logistic loss function, such that  (y i ,f(X i,. ))=log(1−e y     i     −f(X     i,.     ) ).       

     Any MAF unit that is activated for any of the values of λ, and thus predictive, is chosen, i.e. the j th  MAF unit is chosen if ∃k∈{1,2, . . . ,m}\{circumflex over (β)} J (λ k )≠0. As is known, LASSO tools incrementally activate their variables along the regularization path {λ 1 , λ 2 , . . ., λ m }, with one or more variables being added to those already activated as the path {λ 1 , λ 2 , . . ., λ m }, is traversed, to light up a maximum of N variables. The set {λ 1 , λ 2 , . . ., λ m } is advantageously chosen so as to obtain activation of a maximum of MAF units. For example, it is calculated according to the method described in the article by Friedman et al., “ Regularization Paths for Generalized Linear Models via Coordinate Descent ”, Journal of Statistical Software, 2010, or as implemented, for example, by the package glmnet 3.0.2, implemented in R, and available, for example, from the website https://cloud.r-project.org/web/packages/glmnet/index.html. In particular, this method allows the number m of regularization variables λ to be chosen in advance. This number is, for example, chosen equal to 100. 
     The chosen MAF units are referred to hereinbelow as “active MAF units”, the number of active MAF units being noted p a . Their ranks, noted a i  (i.e. their column indices in the matrix X), are stored in a set a={a 1 , a 2 , . . . , a i , . . . , a p     a   }. 
     Step  310  then consists, in  316 , in identifying the MAF units not chosen in step  314  but which have a minimal co-occurrence rate in the genomes with the active MAF units, and then adding the MAF units thus identified to the list of active MAF units. The co-occurrence rate of two units is advantageously measured by the correlation between their corresponding columns of the matrix X. For this purpose, a matrix G, of dimensions p a ×p, is calculated such that: 
       ∀( i,j )∈[1, p   a ]×[1, p ],  G   i,j   =cor ( X   .,a     i     ,X   .,j )   (3)
 
     where cor is, for example, the Bravais-Pearson linear correlation, with X .,a     i    and X .,j  denoting the a i   th  and the j th  columns of the matrix X, respectively. 
     Then, any MAF unit having a correlation higher than a predefined threshold s 1  with an active MAF unit is chosen, and added to the list of active MAF units, the set of MAF units thus chosen being referred to hereinbelow as “extended active MAF units”. In other words, the j th  MAF unit, j∈[1,p], is chosen if ∃i/G i,j &gt;s 1 ·s 1  is a number that sets the required co-occurrence rate between the extended active MAF units. It is between 0.5 and 1, preferably between 0.8 and 1, and advantageously between 0.9 and 0.95, for example 0.95. The total number of extended active MAF units, noted p e , is then much lower than the initial number p of k-mers (p a &lt;p e &lt;&lt;p), of the order of 10 3  as opposed to 10 5  to 10 6 . The ranks of the extended active MAF units, noted e l  (i.e. their column indices in the matrix X), are stored in a set e={e 1 , e 2 , . . . , e l , . . . , e p     e   }. 
     In a subsequent step  318 , groups, or “clusters”, of highly co-occurring extended active MAF units are explicitly defined by implementing a clustering analysis tool. Preferably, hierarchical clustering is implemented based on a distance matrix calculated from the co-occurrence rates between the extended active MAF units. The hierarchical clustering is, for example, that described in the article by Bühlmann P. et al., “Correlated variables in regression: Clustering and sparse estimation”, Journal of Statistical Planning and Inference, 2013, or implemented by the “hclust” function of the Stats 3.6.2 package implemented in R and available, for example, from the website https://www.rdocumentation.org/packages/stats/versions/3.6.2/source, using an aggregation criterion based on the closest distance (or “single-linkage”). 
     More particularly, the distance matrix used by the hierarchical clustering is a matrix D, of dimensions p e ×p e , calculated as follows, where X .,e     i    and X .,e     j    denote the e i   th  and the e j   th  columns of the matrix X, respectively: 
       ∀( i,j )∈[1, p   e ]×[1, p   e ],  D   i,j =|1− cor ( X   .,e     i     ,X   .,e     j   )|  (4)
 
     A dendrogram of the extended active MAF units is thus obtained. This dendrogram is then clustered, at a height 1−s 2  as illustrated in  FIG.  4   , where s 2  is a number between 0 and 1 fixing the co-occurrence rate in the clusters, preferably between 0.5 and 1, preferably between 0.8 and 1, and advantageously between 0.9 and 0.95, for example 0.95. The “lower” part of the dendrogram thus defines clusters in which the extended active MAF units are distributed according to their co-occurrence. Each cluster is also unique and does not share any MAF unit, and in particular any unitigs, with any other cluster. The clusters, being p c  in number, are noted C 1 , C 2 , . . . , C j , . . . , C p     c    and each cluster C j  is the clustering of p j  extended active MAF units of ranks (i.e. their column indices in the matrix X) included in the set c j ={c j,1 , c j,2 , . . . , c j,l , . . . c j,p     j   }. 
     In a subsequent step  320 , for each cluster C j , the unitigs constituting it are broken down into k-mers, with k between 15 and 50, for example k=31, by sliding, in steps of 1, a window of length k over the unitigs. For each cluster C j , if q j  is used to denote the number of unitigs constituting it, q j  sets of k-mers respectively associated with the unitigs are stored. For the sake of clarity, the k-mers and unitigs associated with the clusters are called “cluster k-mers” and “cluster unitigs”, respectively. 
     In a subsequent step  322 , a training model for predicting antibiotic susceptibility is used, the variables of which are the clusters C 1 , C 2 , . . . , C j , . . . , C p     c   . 
     Step  322  begins, in  324 , by calculating the value of each cluster for each genome in the learning database. Advantageously, this value is equal to the average of the values of the MAF units constituting it. A matrix Y of dimensions N×p c , is thus obtained, such that: 
     
       
         
           
             
               
                 
                   
                     ∀ 
                     
                       j 
                       ∈ 
                       
                         [ 
                         
                           1 
                           , 
                           
                             p 
                             c 
                           
                         
                         ] 
                       
                     
                   
                   , 
                   
                     
                       Y 
                       
                         . 
                         
                           , 
                           j 
                         
                       
                     
                     = 
                     
                       
                         1 
                         
                           p 
                           j 
                         
                       
                       × 
                       
                         
                           ∑ 
                           
                             l 
                             = 
                             1 
                           
                           
                             p 
                             j 
                           
                         
                         
                           X 
                           
                             . 
                             
                               , 
                               
                                 c 
                                 
                                   j 
                                   , 
                                   l 
                                 
                               
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
     
     In  326 , several prediction models of antibiotic susceptibility are trained from the learning database, with the next step  328  consisting in selecting the one with the best performance according to predetermined criteria. 
     Advantageously, the prediction models are trained using penalized logistic regression which allows the number of predictive clusters finally retained by the model to be reduced while maintaining a high level of performance. In particular, the prediction models are models according to the following relationships: 
     
       
         
           
             
               
                 
                   { 
                   
                     
                       
                         
                           = 
                           
                             
                               S 
                               ⁢ 
                                   
                               if 
                               ⁢ 
                                   
                               
                                 G 
                                 ⁡ 
                                 ( 
                                 g 
                                 ) 
                               
                             
                             &lt; 
                             
                               S 
                               p 
                             
                           
                         
                       
                     
                     
                       
                         
                           = 
                           
                             
                               NS 
                               ⁢ 
                                   
                               if 
                               ⁢ 
                                   
                               
                                 G 
                                 ⁡ 
                                 ( 
                                 g 
                                 ) 
                               
                             
                             ≥ 
                             
                               S 
                               p 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   
                     G 
                     ⁡ 
                     ( 
                     g 
                     ) 
                   
                   = 
                   
                     
                       
                         B 
                         ^ 
                       
                       0 
                     
                     + 
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         
                           p 
                           c 
                         
                       
                       
                         
                           
                             B 
                             ^ 
                           
                           j 
                         
                         ⁢ 
                         
                           Y 
                           
                             C 
                             j 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
     in which relationships:
            is the predicted susceptibility of a bacterial strain belonging to the bacterial species;   g is the genome of said strain;   {circumflex over (B)} is a parameter vector of    p     c     +1      Y c     j    is the value of the j th  cluster C j  for the genome g   S p  is a predetermined positive threshold.       

     Step  326  starts by training the model G using a parsimonious logistic regression tool on the learning database, e.g. a LASSO type penalized regression. In particular, a model G is calculated for each value λ of a set of positive values {λ 1   c , λ 2   c , . . . , λ i   c , . . . , λ M   c } by solving an optimization problem according to the relationship: 
     
       
         
           
             
               
                 
                   
                     
                       B 
                       ^ 
                     
                     ( 
                     λ 
                     ) 
                   
                   = 
                   
                     
                       arg 
                       
                         min 
                         
                           β 
                           ∈ 
                           
                             ℝ 
                             
                               p 
                               + 
                               1 
                             
                           
                         
                       
                       
                         
                           ∑ 
                           
                             i 
                             = 
                             1 
                           
                           N 
                         
                         
                           ℒ 
                           ⁡ 
                           ( 
                           
                             
                               y 
                               i 
                             
                             , 
                             
                               G 
                               ⁡ 
                               ( 
                               
                                 Y 
                                 
                                   i 
                                   , 
                                   . 
                                 
                               
                               ) 
                             
                           
                           ) 
                         
                       
                     
                     + 
                     
                       λ 
                       ⁢ 
                       
                         
                           ∑ 
                           
                             j 
                             = 
                             1 
                           
                           p 
                         
                         
                           
                             ❘ 
                             &#34;\[LeftBracketingBar]&#34; 
                           
                           
                             β 
                             j 
                           
                           
                             ❘ 
                             &#34;\[RightBracketingBar]&#34; 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
     in which relationship:
         y i  is the susceptibility to the measured antibiotic of the i th  bacterial strain, associated with the i th  row of the matrix Y, i.e. y i =0 if said strain is sensitive and y i =1 otherwise;      is a logistic loss function, quantifying the difference between the measured phenotype y i  and the predicted phenotype G(Y i,. ), for example a squared difference of these two terms or a logistic loss function, such that  (y i ,f(X i,. ))=log(1−e y     i     −f(X     i,.     ) ).       

     For example, it is calculated according to the method described above in connection with step  314 , with a number M=100. 100 models are thus obtained, noted   and thus 100 prediction models according to the relationships (5)-(6), each depending on the threshold value S p , denoted hereinbelow as  (S p ). 
     An estimate of the performance of each prediction model  (S p ), is then calculated in  328  from the test database. The performance evaluation makes it possible in parallel to calculate the threshold value S p . 
     In particular, in a step  330 , for each genome in the test base, the following are performed:
         a. detection of cluster k-mers present in the genome by perfect homology, i.e. a k-mer is detected if it is present in identical form in the genome;   b. detection that a cluster unitig is present in the genome if the percentage of cluster k-mers constituting it, determined as present in the genome in the preceding step, is higher than a first predetermined detection threshold s uni ;   c. calculating an indicator for detecting that an extended MAF unit consisting of several cluster unitigs is present in the genome, defined according to any of the following options:
           i. the indicator is equal to 1 if the percentage of cluster unitigs constituting it, determined to be present in the preceding step, is greater than a second predetermined detection threshold s clus , for example a threshold greater than or equal to 20%, for example 25%. Otherwise, the indicator is equal to 0. This option is the one applied for the examples described below; or   ii. the indicator is equal to 1 if all the constituent cluster unitigs are determined to be present in the preceding step, and equal to 0 otherwise; or   iii. the indicator is equal to 1 if at least one constituent cluster unitig is determined to be present in the preceding step, and equal to 0 otherwise.   iv. the indicator is equal to the percentage of cluster unitigs constituting it which have been detected as present in the preceding step.   
               

     Advantageously, the detection threshold s uni  depends on the length of the cluster unitig. In particular, for k between 15 and 50, for example k=31, noting L the length of a cluster unitig for which it is sought to know the presence in the genome, if L≤61 then s uni =90%, if  61 &lt;L≤100 then s uni =80% and if 100&lt;L then s uni =70%. 
     Step  328 , in  330 , by calculating the value of a cluster as being equal to the mean of the detection indicators of the extended MAF units constituting it, determined in the preceding step. It should be noted that for options i, ii and iii, this mean corresponds to the percentage of extended MAF units detected as present. Once the cluster values have been calculated for all the genomes in the test base, step  330  continues with a model selection strategy that maximizes the sensitivity, specificity and parsimony of the model (i.e. minimizes the number of clusters actually used to predict susceptibility). To do this, for each model  (S p ), the threshold S p  is varied, and for each value of the threshold S p  the sensitivity and specificity are calculated according to the relationships: 
     
       
         
           
             
               
                 
                   sensitivity 
                   = 
                   
                     
                       T 
                       ⁢ 
                       P 
                     
                     
                       
                         T 
                         ⁢ 
                         P 
                       
                       + 
                       
                         F 
                         ⁢ 
                         N 
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   specificity 
                   = 
                   
                     
                       T 
                       ⁢ 
                       N 
                     
                     
                       
                         F 
                         ⁢ 
                         P 
                       
                       + 
                       
                         T 
                         ⁢ 
                         N 
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
     where TP, TN, FP, and FN are the numbers of true positives, true negatives, false positives, and false negatives described in Table 1, respectively. 
     
       
         
           
               
               
               
               
             
               
                   
                 TABLE 1 
               
             
            
               
                   
                   
               
               
                   
                   
                   
                 Real condition y i   
               
            
           
           
               
               
               
               
               
            
               
                   
                   
                   
                 NS 
                 S 
               
               
                   
                   
               
               
                   
                 Prediction 
                 NS 
                 TP 
                 FP 
               
               
                   
                 
                   
                 
                 S 
                 FN 
                 TN 
               
               
                   
                   
               
            
           
         
       
     
     The values of sensitivity and of (1 minus the specificity) for the threshold values S p  are then plotted on an ROC curve on the y-axis and x-axis respectively, and the area under the ROC curve, denoted “AUC”, is calculated and stored. 
     An optimal value   of the threshold S p  for the model  (S p ) is then calculated as the one corresponding to the point on the ROC curve closest to the point of abscissa 0 and ordinate 1, as illustrated in  FIG.  5   . The balanced accuracy (“bACC”) is then calculated for the model  ( ) according to the following relationship, the bACC, sensitivity and specificity for the model  ( ) are stored: 
     
       
         
           
             
               
                 
                   bACC 
                   = 
                   
                     
                       sensitivity 
                       + 
                       specificity 
                     
                     2 
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
     The model finally retained among the models  ( ) is the most parsimonious model maximizing the bACC to within one tolerance, for example the model such that:
         a. A is the set of models  ( ) such that their bACC is greater than max(bACC)−0.01, or max(bACC) is the maximum of the calculated bACCs;   b. the chosen model is the most parsimonious model in the set A.       

     The chosen model is stored in a computer memory for subsequent use  40  consisting in predicting the antibiotic susceptibility for a bacterial strain of the bacterial species. The retained clusters, and thus the constituent unitigs, thus form a genomic signature of antibiotic susceptibility. 
     In particular, this prediction consists in:
         a. sequencing, in  400 , the genome of the bacterial strain by applying a complete genome sequence, for example in the manner described in relation to  FIG.  1   ;   b. calculating, in  402 , the value of each cluster in the stored prediction model in the manner described previously;   c. calculating, in  404 , the susceptibility   of the strain using the relationships (5)-(6) for the stored model.       

     B. Examples 
     B.1.  Klebsiella pneumoniae    
     The process described in  FIGS.  2 A and  2 B  was performed for the prediction of the susceptibility to different antibiotics of the bacterial species  K. pneumoniae . Table 2 lists the number of strains used for the training and validation of the prediction model, their NS/S phenotypes and the various antibiotics tested. 
     Table 3 lists the performance of the model trained in accordance with the process according to the invention, known as “cluster-lasso model” or “cluster-lasso”, and the performance of a prediction model trained solely on the basis of a prior art Lasso logistic regression, called “lasso model” or “lasso”. The performance presented in this table corresponds to an estimation by cross-validation, according to the procedure described previously. For the latter, models according to relationships (1) and (2) are calculated, thresholds   and a final model chosen in the manner described previously for the process according to the invention, and thus on the basis of the same performance criteria. 
     The “&#39;support” columns indicate the number of predictor variables retained for the prediction model, i.e. the number of clusters for which {circumflex over (B)} j ≠0 or the cluster-lasso and the number of “active MAF units” for which {circumflex over (β)} J  for the lasso. The “unitigs” columns indicate the total number of unitigs retained for the genomic signature, with the number of unitigs in the broadest of the predictor variables in parentheses. 
     
       
         
           
               
               
               
             
               
                 TABLE 2 
               
             
            
               
                   
               
               
                   
                 Learning database 
                 Test database 
               
            
           
           
               
               
               
               
               
            
               
                   
                 NS 
                 S 
                 NS 
                 S 
               
               
                   
               
            
           
           
               
               
               
               
               
            
               
                 amikacin 
                 346 
                 1319 
                 191 
                 160 
               
               
                 aztreonam 
                 1426 
                 216 
                 250 
                 10 
               
               
                 cefepime 
                 961 
                 608 
                 235 
                 53 
               
               
                 cefoxitin 
                 976 
                 667 
                 319 
                 138 
               
               
                 ceftazidime 
                 1259 
                 136 
                 457 
                 125 
               
               
                 ciprofloxacin 
                 1461 
                 201 
                 471 
                 137 
               
               
                 imipenem 
                 504 
                 1160 
                 259 
                 301 
               
               
                 meropenem 
                 524 
                 1134 
                 297 
                 86 
               
               
                 piper.tazo 
                 1228 
                 432 
                 382 
                 146 
               
               
                 tetracycline 
                 928 
                 737 
                 273 
                 155 
               
               
                   
               
            
           
         
       
     
     
       
         
           
               
               
               
             
               
                   
                 TABLE 3 
               
             
            
               
                   
                   
               
               
                   
                 Lasso 
                 Cluster-lasso 
               
            
           
           
               
               
               
               
               
               
               
               
               
            
               
                   
                 bACC 
                 AUC 
                 support 
                 unitigs 
                 bACC 
                 AUC 
                 support 
                 unitigs 
               
               
                   
                   
               
            
           
           
               
               
               
               
               
               
               
               
               
            
               
                 amikacin 
                 92.7 
                 95.4 
                 16 
                 22(4) 
                 92.3 
                 95.7 
                 11 
                 93(36) 
               
               
                 aztreonam 
                 76.7 
                 81.9 
                 31 
                 45(3) 
                 76.9 
                 82.3 
                 28 
                 425(125) 
               
               
                 cefepime 
                 74.0 
                 80.4 
                 53 
                 65(3) 
                 73.6 
                 79.8 
                 34 
                 385(111) 
               
               
                 cefoxitin 
                 82.4 
                 88.7 
                 134 
                 155(5)  
                 82.2 
                 88.8 
                 171 
                 1052(221)  
               
               
                 ceftazidime 
                 91.6 
                 95.8 
                 51 
                 69(5) 
                 90.7 
                 95.3 
                 43 
                 863(185) 
               
               
                 ciprofloxacin 
                 95.6 
                 98.6 
                 25 
                 27(2) 
                 95.5 
                 98.6 
                 35 
                 422(139) 
               
               
                 imipenem 
                 93.1 
                 93.6 
                 10 
                 10(1) 
                 92.7 
                 93.4 
                 7 
                 241(194) 
               
               
                 meropenem 
                 91.7 
                 94.0 
                 8 
                  8(1) 
                 91.4 
                 93.5 
                 3 
                 164(159) 
               
               
                 piper.tazo 
                 81.6 
                 89.6 
                 127 
                 144(4)  
                 81.5 
                 89.0 
                 120 
                 1220(226)  
               
               
                 tetracycline 
                 83.0 
                 88.5 
                 181 
                 198(3)  
                 82.9 
                 87.7 
                 109 
                 640(104) 
               
               
                   
               
            
           
         
       
     
     As may be seen, the performance of the cluster-lasso model is similar to that of a prediction model whose learning variables are not constrained by clustering. It is thus noted that the two models show similar performance in terms of balanced accuracy bACC and of AUC, confirming that taking or not taking into account the correlation between the traits has a limited impact in terms of predictive performance. It is also noted that the model support is often slightly smaller with the cluster-lasso (for 8 out of 10 antibiotics), suggesting that several traits chosen separately with the lasso ended up merging into a single cluster through the cluster-lasso. As expected, the total number of unitigs involved in a cluster-lasso model is significantly larger. It is noted that this number is not evenly distributed among the predictive clusters. For example, in the model predicting susceptibility to meropenem, 159 of the 164 unitigs are present in a single cluster, suggesting the presence of a gene as a predictive genomic trait. 
       FIG.  6 (A)  shows the magnitude of the coefficients of the models for meropenem. As is seen, the signature of the cluster-lasso model is essentially summarized by a single important trait, while 4 to 5 traits of the lasso signature have an appreciable weight. It turns out that the cluster with the greatest predictive weight is also the largest cluster in number of unitigs. The visualization of this cluster in the compacted De Bruijn graph cDBG (e.g. using the DBGWAS software, described earlier), as shown in  FIG.  6 (C) , shows that the unitigs of this cluster form a long linear path in the graph. This thus suggests that this cluster corresponds to an entire gene. The annotation of this linear pathway, provided by the DBGWAS software, indicates that it corresponds to the blaKPC gene, which is also well documented in the literature for its role in meropenem resistance. The visualization obtained for the lasso signature indicates, conversely, that three of the eight predictor variables—variables 1, 2 and 4—are also colocated in a region annotated as being the blaKPC gene. However, the fact that the lasso chose these specific unitigs within the blaKPC gene suggests that the resistance determinants involved are point mutations in this gene, namely SNPs or indels. While the annotation of the gene is the same as that obtained with the cluster-lasso, the interpretation of the signature in terms of genetic variants is therefore radically different. More in-depth examination of the lasso signature reveals that the three variables located in the blaKPC gene are in fact highly correlated. By explicitly detecting, according to the invention, that these entities are correlated and merging them into a cluster, along with other correlated genomic units that are not even involved in the lasso signature, the cluster-lasso thus leads to a more biologically meaningful interpretation of the underlying prediction model in two respects. Firstly, as regards the nature of the genomic determinant involved: acquisition or mutation within a gene. Secondly, in terms of its overall contribution to predicting susceptibility, by summing the contributions of several distinct but correlated traits involved in the lasso signature. 
     Similarly,  FIG.  7    illustrates the interpretability of the two prediction models for cefoxitin. Focusing on the subgraphs of the cDGB graph in which the two most predictive clusters are located, the annotation of these two regions identifies the same resistance genes for both methods (firstly, the OmpK36 gene, known to be involved in efflux pumps, and secondly the blaKPC gene). On the other hand, the nature of the genomic determinant (gene presence, SNP, indel, etc.) cannot be deduced from the lasso signature. 
     The interpretability can even be very detailed. For example, as regards the OmpK36 annotated subgraph obtained for the cluster-lasso signature (top right panel of  FIG.  7   ), it comprises two clusters (clusters 1 and 3), clustering 9 unitigs. These unitigs show a topology attributable to a local polymorphism, namely a complex bubble, with a fork separating the sensitive and resistant strains as described in the article by Jaillard M. et al. “ A fast and agnostic method for genome - wide association studies: Bridging the gap between k - mers and genetic events ”, PLOS Genetics, 2018. In contrast, the corresponding subgraph obtained for the lasso (top left panel of  FIG.  7   ) includes four units (units 1, 2, 32 and 56) with four distinct values of {circumflex over (β)} J . The distinct values of {circumflex over (β)} J  may lead to erroneous conclusions regarding the individual importance of the corresponding unitig sequences. Indeed, when considering a multiple alignment incorporating additional annotated sequences of OmpK36, it appears that active MAF units 2 and 56 represent the wild type and that units 1 and 32 align on the same two amino acid insertion in the L3 loop, as described in the article by Novais A. et al., “ Spread of an OmpK 36- modified ST 15  Klebsiella pneumoniae variant during an outbreak involving multiple carbapenem - resistant Enterobacteriaceae species and clones ”, European Journal of Clinical Microbiology and Infectious Diseases, 2012. The invention instead provides mean B j  values for each haplotype. 
     The second subgraph obtained for the lasso signature (bottom left panel of  FIG.  7   ) comprises only one signature trait (shown in black) and seven surrounding nodes (shown in gray), two of which are annotated blaKPC. As the single signature node is not itself annotated, the subgraph could be interpreted as a local polymorphism in the promoter region of the blaKPC gene. However, the cluster-lasso subgraph (bottom right panel of  FIG.  7   ) indicates that this single unitig was chosen by the lasso from hundreds of highly correlated unitigs: they all belong to cluster 2, which includes the complete blaKPC gene (shown in parentheses) and the plasmid sequences in which it is inserted that are highly co-occurring with the gene sequences. 
     The additional information provided by the cluster-lasso thus makes it possible to conclude that the first causal variable of cefoxitin resistance is a local mutation in the OmpK36 gene. Advantageously, molecular technologies (PCR, NGS, etc.) for predicting cefoxitin resistance will specifically target this mutation. Furthermore, the second causal variable is the acquisition of a complete blaKPC gene, and any DNA sequence specific to blaKPC may advantageously be used by such technologies to predict cefoxitin resistance. 
     Other bacterial species/antibiotic pairs were tested. Without going into great detail in relation to  Klebsiella pneumoniae , the following is described for  Salmonella  species,  Staphylococcus aureus  and  Neisseria gonorrhoeae:  
         a first table and a second table similar to Tables 2 and 3 above respectively;   a first, second and third figure illustrating respectively, for the antibiotic under consideration, the absolute values of the coefficients of the lasso model, the absolute values of the coefficients of the cluster-lasso model, and the number of unitigs included in the first 10 most predictive clusters of the cluster-lasso model;   a figure illustrating:
           in its left-hand side, the subgraph(s) of the compacted cDBG graph, involving the most predictive extended MAF units of the lasso model. The subgraphs are first identified by the most predictive units and when other units are present in the subgraph, they are also represented;   in its right-hand side, the subgraph(s) of the compacted cDBG graph involving the most predictive clusters of the cluster-lasso model. The subgraphs are first identified by the most predictive clusters and when other clusters are present in the subgraph, they are also represented.   
               

     B.2.  Salmonella    
     Tables 4 and 5,  FIGS.  8  and  9    for tetracycline,  FIGS.  10  and  11    for gentamicin. 
     Unlike the lasso model, which identifies a possible set of point mutations in the TetB genes for the acquisition of tetracycline resistance, without this being otherwise conclusive in view of the large number of mutations that this would imply, the invention based on cluster-lasso identifies the acquisition of resistance for the presence of the TetA gene (cluster 1), the TetB/TetD genes (cluster 2), as well as the acquisition of the TetR gene. 
     As regards gentamicin resistance, the invention concludes that the AAC3 gene (cluster 1) is acquired and that the OXA, IMP and TEM genes are involved in the resistance mechanisms, whereas the lasso model fails to identify the OXA and IMP genes. 
     
       
         
           
               
               
               
             
               
                   
                 TABLE 4 
               
             
            
               
                   
                   
               
               
                   
                   
                 Learning database 
               
            
           
           
               
               
               
               
            
               
                   
                   
                 NS 
                 S 
               
               
                   
                   
               
            
           
           
               
               
               
               
            
               
                   
                 tetracycline 
                 2597 
                 1901 
               
               
                   
                 gentamicin 
                 637 
                 3862 
               
               
                   
                   
               
            
           
         
       
     
     
       
         
           
               
               
               
             
               
                   
                 TABLE 5 
               
             
            
               
                   
                   
               
               
                   
                 Lasso 
                 Cluster-lasso 
               
            
           
           
               
               
               
               
               
               
               
            
               
                   
                 bACC 
                 AUC 
                 support 
                 bACC 
                 AUC 
                 support 
               
               
                   
                   
               
            
           
           
               
               
               
               
               
               
               
            
               
                 tetracycline 
                 97.4 
                 98.2 
                 29 
                 97.1 
                 98.1 
                 15 
               
               
                 gentamicin 
                 96.8 
                 98.2 
                 48 
                 96.5 
                 98.2 
                 34 
               
               
                   
               
            
           
         
       
     
     B.3.  Neisseria gonorrhoeae    
     Tables 6 and 7,  FIGS.  12  and  13   . 
     As regards cefixime resistance in  N. gonorrhoeae , the invention identifies the acquisition of several recombinations in the penM gene. 
     
       
         
           
               
               
               
             
               
                   
                 TSBLE 6 
               
             
            
               
                   
                   
               
               
                   
                   
                 Learning database 
               
            
           
           
               
               
               
               
            
               
                   
                   
                 NS 
                 S 
               
               
                   
                   
               
               
                   
                 cefixime 
                 110 
                 554 
               
               
                   
                   
               
            
           
         
       
     
     
       
         
           
               
               
               
             
               
                   
                 TABLE 7 
               
             
            
               
                   
                   
               
               
                   
                 Lasso 
                 Cluster-lasso 
               
            
           
           
               
               
               
               
               
               
               
            
               
                   
                 bACC 
                 AUC 
                 support 
                 bACC 
                 AUC 
                 support 
               
               
                   
                   
               
            
           
           
               
               
               
               
               
               
               
            
               
                 cefixime 
                 91.7 
                 97.2 
                 45 
                 92.1 
                 97.5 
                 40 
               
               
                   
               
            
           
         
       
     
     
       Staphylococcus aureus  
     
     Tables 8 and 9,  FIGS.  14  and  15   . 
     As regards tetracycline resistance in  S. aureus , the invention identifies the acquisition of the TetK gene (cluster 1), but rules out the acquisition of the TetM gene (clusters 2 and 3) as being a highly predictive genomic determinant of gentamicin resistance in view of the low coefficients of the clusters involved, unlike the lasso model, which interprets the TetM gene as highly predictive. 
     
       
         
           
               
               
               
             
               
                   
                 TABLE 8 
               
             
            
               
                   
                   
               
               
                   
                   
                 Learning database 
               
            
           
           
               
               
               
               
            
               
                   
                   
                 NS 
                 S 
               
               
                   
                   
               
               
                   
                 tetracycline 
                 27 
                 468 
               
               
                   
                   
               
            
           
         
       
     
     
       
         
           
               
               
               
             
               
                   
                 TABLE 9 
               
             
            
               
                   
                   
               
               
                   
                 Lasso 
                 Cluster-lasso 
               
            
           
           
               
               
               
               
               
               
               
            
               
                   
                 bACC 
                 AUC 
                 support 
                 bACC 
                 AUC 
                 support 
               
               
                   
                   
               
            
           
           
               
               
               
               
               
               
               
            
               
                 tetracycline 
                 96.9 
                 96.7 
                 12 
                 98.9 
                 99.6 
                 10 
               
               
                   
               
            
           
         
       
     
     C. Computer Means for Performing the Invention 
     Steps  302 ,  304 ,  312 ,  320 , just like steps  60  and  80  described below, are performed by computer, for example a computer unit comprising one or more processors, storage space and random-access memories, capable of storing computer instructions which, when executed, perform the calculations described previously. The computing unit is, for example, a personal computer, a server, or a computing cluster. Similarly, steps  402 ,  404  are performed by computer, for example a computer unit as described previously. The unit of steps  302 ,  304 ,  312 ,  320  and the unit of steps  402 ,  404  are different or are the same unit. Advantageously, the predicted susceptibility is displayed on a computer screen, stored in a laboratory or hospital computer system to supplement a patient&#39;s record when the bacterial strain infects a patient, or is transmitted to a clinician&#39;s mobile device, for example a smartphone. 
     D. Extension of the Teaching of the Embodiment of the Invention 
     D.1. As Regards the Detection of the Presence of k-mers, unitigs and MAF Units in the Bacterial Genome—Step  330   
     Step  330  describes a way of detecting the presence or absence of a genome sequence, in particular a unitig, or a set of genome sequences in a bacterial genome, in particular a set of units clustering unitigs. In general, the embodiment addresses the issue of whether a sequence or set of sequences should be detected identically in the genome or whether it is possible to accept a certain level of difference between the sequence or group of sequences and the sequences or groups of sequences in the genome in order to decide on their presence or absence. In particular, as explained in the preamble, perfect homology assumes that the learning data is complete to encompass all the variability of the biological species, which is de facto difficult, notably in view of the plasticity of their genome. 
     Furthermore, the sequenced genome can be tainted by error, notably when it is in the form of “reads”, i.e. sequences produced at the output of sequencing platforms before any bioinformatics processing such as consensus assembly or filtering of poor-quality reads. In this case, a sequence, although present in the genome, may be detected as absent due to sequencing errors and vice versa. In particular, bioinformatics processing generally includes filtering of low-quality reads, and optionally consensus assembly of the filtered reads to obtain assembled sequences, or “contigs”. The optional nature of the assembly generally depends on the context in which the sample analysis is performed. The effect of assembly is to significantly reduce sequencing errors in contigs, at the present time to a level of 10 −5  for SBS technologies used in the platforms of the company Illumina Inc. and to a level of 10 −2  for nanopore technologies used in the platforms of the company Oxford Nanopore Technologies Ltd. On the other hand, since assembly requires high computing power and time, it is not very well suited to “POC” (“point of care”) genomic applications where the computing environment is generally not very powerful and/or to fast, or even real-time applications. In this context, genomic analysis, for example to determine the identity of the one or more species present in the sample and/or their susceptibility to one or more antibiotics as described previously, is performed directly on the filtered or unfiltered reads. However, sequencing errors are of the order of 2 to 3% for SBS technologies and up to 12% for nanopore technologies. Without special precautions, genomic analysis can lead to an equally high error rate. 
       FIG.  16    illustrates a process  50  directed toward more robustly detecting the presence or absence of a genome sequence in a microorganism genome, notably a bacterial strain, a yeast strain or a mold strain, to account for genomic variability and sequencing errors. This process, although independent per se of the processes of  FIGS.  2 A and  2 B , is advantageously performed in step  330  and/or step  402  thereof. 
     The process  50  comprises a step  70  of sequencing a sample comprising one or more microorganism strains, in the text hereinbelow, and by way of example only, one or more bacterial strains, and pre-processing the reads produced by the sequencing platform, and a step  80  of detecting a predetermined genome sequence in the genome of one of the bacterial strains. This step  80  optionally includes the detection of at least one predetermined set of genome sequences in said genome. 
     Step  80  uses a breakdown of the genome sequence, and also a certain number of parameters, calculated in a step  60 , for example performed prior to the process  50 , and stored in a database DB. More particularly, with reference to  FIG.  17   , step  60  begins with a step  600  in which the genome sequence, noted “SEQ”, is broken down into k-mers of constant length k, with k between 15 and 50, for example k=31, by sliding, in constant steps, preferentially with a step of 1, a window W of length k over the sequence SEQ. At each position of the window W, a k-mer is thus stored. For a sequence SEQ of length L, (L−k+1) k-mers are thus produced. In a subsequent optional step  602 , the set of k-mers produced is filtered of its possible duplicates to keep only a set consisting of unique k-mers, noted KM={km 1 , . . . , km i , . . . , km s }, this set forming the breakdown of the sequence SEQ stored in the DB. 
     Step  70  involves, as is known per se, and for example described in relation to  FIG.  1   :
         in a step  700  preparing the sample for sequencing of the DNA contained in the sample and sequencing the prepared DNA, so that reads are produced and stored;   in a step  702  performing bioinformatics processing generally comprising filtering out of low-quality reads, and optionally assembling the filtered reads by consensus so as to obtain and store assembled sequences, or “contigs”.       

     The step  80  of detection of the genome sequence SEQ starts with a first test, in  800 , which consists in knowing if this detection is performed on contigs or reads. If the detection is performed on contigs, i.e. genome sequences whose error rate is low enough to allow the use of perfect homology through the detection of k-mers, the process continues, in  802 , by detecting the presence or absence of each k-mer km i  of the KM set in the contigs. In particular, the k-mer km i  is detected if it is identically present in at least one of the contigs. 
     In a subsequent step  804 , a test is performed to determine whether the sequence SEQ should be detected identically in the bacterial genome. If so, the sequence SEQ is detected, in  806 , if all the k-mers km i  in the KM set are detected as being present in the contigs. It is noted in this regard that due to the sequencing technology and/or the assembly technology, the sequence SEQ does not necessarily end up whole in a contig, but may instead be split between several contigs, with the probability of such splitting increasing with the length L of the sequence SEQ. The breakdown into k-mers thus makes it possible to identify the latter in the genome even if it is not present as such in the contigs. 
     If the sequence SEQ is not sought in an identical manner in  804 , the genome is searched in  808  for at least the sequence SEQ or one of its variants. These variants correspond, for example, to mutations in the original sequence SEQ or to imperfect identification of the latter. As described above, the sequence SEQ may be the product of identification of a genetic determinant (e.g. of resistance, virulence, identity, etc.) based on a priori data or knowledge. If the latter is imperfect, the sequence SEQ may not reflect the full diversity of said determinant. By permitting the identification of the sequence SEQ or one of its variants, the process allows the initial imperfection of the data and knowledge to be corrected and thus the genetic determinant to be detected. To a lesser extent, it also allows possible residual sequencing errors in the contigs to be taken into account. Furthermore, independently of the error correction, it also makes it possible, from a single sequence SEQ, to detect whether at least one member of a set of variants is present in the genome, without having to perfectly detect each of said variants. 
     In a first variant, in  808 , the sequence SEQ or one of its variants is detected if the percentage of its constituent k-mers is greater than a predetermined threshold s uni , for example greater than 70%. In a preferred variant, this percentage is dependent on the length L of the sequence SEQ and more particularly decreases as a function of L. Specifically, it is preferable to keep a sufficiently long length of k-mers, in particular greater than 15, and preferably greater than 30, so that the latter remain specific to the sequence SEQ. Thus, as the length L decreases, a difference with the sequence SEQ is found in an increasingly large percentage of k-mers, which makes it possible to correct for the percentage s uni  decreasing as a function of the length L. As illustrated in  FIG.  18   , the percentage s uni  is, for example, decreasing by piece, and comprises three values. Advantageously, for k between 15 and 50, for example k=31, if L≤61 then s uni =90%, if 61&lt;L≤100 then s uni =80% and if 100&lt;L then s uni =70%. 
     Once the sequence SEQ has been detected, optionally, the process continues, at  810 , with the detection of a set of genome sequences, denoted {SEQ 1 , . . . , SEQ i , . . . SEQ E }, in a manner described below. 
     If the detection of the sequence SEQ is performed on reads (test  800 ), and thus before any bioinformatics processing correcting sequencing errors, the process takes these errors into account to accurately detect the presence/absence of a k-mer in the reads, and thus in the genome. The advantage of detecting directly from the reads lies in the speed of data processing, which is less than 2-3 minutes for a given computational environment, whereas assembly alone can take over an hour for the same environment. 
     In a first variant, a k-mer is detected if the reads contain a minimum number of copies of said k-mer, for example a number greater than or equal to 3. However, this variant has the drawback of not taking into account the sequencing depth of coverage. To a first approximation, the sequencing errors are distributed over the entire genome and as such the greater the sequencing depth of coverage, the higher the probability of detecting the k-mer. However, due to sequencing errors, it is difficult to ascertain whether the k-mer is actually present in the genome or whether the k-mer detected in the reads is the product of another k-mer bearing sequencing errors. In a preferred variant, detection depends on the actual sequencing depth of coverage for the bacterial strain in which the sequence SEQ is sought. 
     To this end, a test  812  is performed to determine whether the sample is a metagenomic sample, or more generally a sample containing several different species (several bacterial species, human DNA, or other), or a sample prepared from an isolate of the bacterial strain. In the latter case, since only one strain is present, all reads belong to said strain and the sequencing depth of coverage, noted “cov”, is calculated, in  814 , for example according to the relationship: 
     
       
         
           
             
               
                 
                   cov 
                   = 
                   
                     
                       N 
                       r 
                     
                     
                       N 
                       g 
                     
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
     in which relationship N r  is the total number of bases included in the reads and N g  is the number of bases in a reference genome of the bacterial species to which the bacterial strain belongs, preferentially having a mean size or close to the mean of the genome sizes observed for said species (e.g. Ng=4.4 million base pairs (Mbp) for  Mycobacterium tuberculosis ). 
     A copy number, noted N cov , which needs to be detected in the reads to affirm that a k-mer is indeed present in the genome, is then calculated in  816  according to the following relationship: 
         N   cov   =τ×cov    (11)
 
     where τ is a predetermined parameter, preferentially taking into account the sequencing error rate of the sequencing technology used, advantageously between 5% and 15%, preferably greater than or equal to 10%, for example 10%. For the latter percentage and a depth of 100, 10 identical copies of a k-mer must therefore be detected to determine that it is actually present in the reads. A rate of 10% notably enables the presence of a k-mer to be accurately detected in reads produced by a GridION platform from the company Oxford Nanopore Technology Ltd using the R9.4 library preparation kit from the same company. This rate also allows precision detection in reads produced by SBS-type sequencing technology, for example the MiSeq platform from the company IIlumina Inc. 
     Detection of the presence or absence of each k-mer km i  of the KM set in the reads is then performed in  818 . In particular, the k-mer km i  is detected if there are at least N cov  identical copies in the reads. The process then continues with step  804  described previously. 
     If the sample comprises several species (test  812 ), the process consists in determining the sequencing depth of coverage for the bacterial species under consideration. More particularly, “taxonomic binning” is performed in  820 , such binning consisting in assigning to each read an origin among the species present in the sample. This type of binning is well known in the prior art and uses, for example, the classification described in the article by Wood D. E. et al., “Kraken: ultrafast metagenome sequence classification using exact alignments”, Genome Biology, 2014, or as performed by the “Kraken2” software downloadable from the website https://github.com/DerrickWood/kraken2/releases. 
     The sequencing depth of coverage of said bacterial species under consideration is then calculated, for example according to either of the following relationships: 
     
       
         
           
             
               
                 
                   cov 
                   = 
                   
                     
                       N 
                       r 
                       m 
                     
                     
                       N 
                       g 
                     
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   cov 
                   = 
                   
                     ρ 
                     × 
                     
                       
                         N 
                         r 
                       
                       
                         N 
                         g 
                       
                     
                   
                 
               
               
                 
                   ( 
                   13 
                   ) 
                 
               
             
           
         
       
     
     in which relationship N r   m  is the total number of bases included in the reads assigned to the bacterial species to which the bacterial strain under consideration belongs, and N g  is the number of bases in a medium-sized genome of the bacterial species, and ρ is the relative proportion of the bacterial species in the sample. This relative proportion is calculated, for example, using the classification described in the article by Wood D. E. et al., “Kraken: ultrafast metagenome sequence classification using exact alignments”, Genome Biology, 2014, or as performed by the “Kraken2” software downloadable from the website https://github.com/DerrickWood/kraken2/releases. The process continues with step  816  of calculating the copy number as a function of the sequencing depth of coverage just calculated. 
     Referring again to step  810  of detecting the set of genome sequences, denoted {SEQ 1 , . . . , SEQ i , . . . SEQ E }, this step follows the detection of each sequence SEQ i  in the manner described previously. More particularly, the detection of said set is implemented according to one of the following options:
         i. the set is detected as present in the genome if the percentage of SEQ i  determined as being present is greater than a second predetermined detection threshold s clus , for example a threshold greater than or equal to 20%, e.g. 25%, and absent otherwise; or   ii. the set is detected as present in the genome if all the SEQ i  are determined as being present, and absent otherwise; or   iii. the set is detected as present in the genome when at least one of the sequences SEQ i  is determined as being present, and absent otherwise; or   iv. the set is detected as present in the genome with a probability equal to the percentage of SEQ i  determined as being present.       

     Firstly, it is noted that the detection performance of sequences SEQ or sets of SEQs is very similar to that obtained directly by k-mer identification, as evidenced by the performance of a cluster-lasso based process compared to the performance of a lasso-based process as described previously. 
     Secondly, the detection process  50  is robust with respect to the type of sequencing technology employed, and notably to their sequencing errors. The following table illustrates, for 37 test strains of  Klebsiella pneumoniae  species in isolate form, with variant detection (percentage 70%, 80%, 90%) for unitigs (equivalent to SEQ i ) and unit detection according to option i) above, the results of a cluster-lasso prediction of resistance to different antibiotics for sequencing by an MiSeq (“Illumina”) and by a GridION (“ONT”). The two sequencing technologies are tested as a function of their reads and the contigs produced by the assembly of their reads. Table 10 shows that the results are similar for both technologies, whereas they have significantly different sequencing error rates, but also similar results for both reads and contigs. 
     
       
         
           
               
               
               
               
               
               
             
               
                   
                 TABLE 10 
               
               
                   
                   
               
               
                   
                 Type of data 
                 bACC 
                 Sensitivity 
                 Specificity 
                 AUC 
               
               
                   
                   
               
             
            
               
                   
               
            
           
           
               
               
               
               
               
               
            
               
                 Piperacillin 
                 Illumina Reads 
                 86.5 
                 81.5 
                 100 
                 91.1 
               
               
                   
                 Illumina Contigs 
                 86.5 
                 81.5 
                 100 
                 92.2 
               
               
                   
                 ONT Reads 
                 89.2 
                 85.2 
                 100 
                 91.9 
               
               
                   
                 ONT Contigs 
                 86.5 
                 81.5 
                 100 
                 91.1 
               
               
                 Cefepime 
                 Illumina Reads 
                 94.6 
                 92.3 
                 100 
                 98.3 
               
               
                   
                 Illumina Contigs 
                 97.3 
                 96.2 
                 100 
                 98.6 
               
               
                   
                 ONT Reads 
                 94.6 
                 92.3 
                 100 
                 96.5 
               
               
                   
                 ONT Contigs 
                 97.3 
                 96.2 
                 100 
                 98.3 
               
               
                 Meropenem 
                 Illumina Reads 
                 86.5 
                 81.0 
                 93.3 
                 92.7 
               
               
                   
                 Illumina Contigs 
                 86.5 
                 81.0 
                 93.8 
                 92.7 
               
               
                   
                 ONT Reads 
                 78.4 
                 61.9 
                 100 
                 86.9 
               
               
                   
                 ONT Contigs 
                 86.5 
                 81.0 
                 93.8 
                 92.6 
               
               
                 Ciprofloxacin 
                 Illumina Reads 
                 94.6 
                 96.0 
                 91.7 
                 95.7 
               
               
                   
                 Illumina Contigs 
                 94.6 
                 96.0 
                 91.7 
                 95.7 
               
               
                   
                 ONT Reads 
                 91.9 
                 88.0 
                 100 
                 96.7 
               
               
                   
                 ONT Contigs 
                 94.6 
                 96.0 
                 91.7 
                 95.7 
               
               
                   
               
            
           
         
       
     
     Furthermore, the prediction performance (AUC) as a function of sequencing depth of coverage for the ONT technology is shown in  FIGS.  19 A  (for lasso prediction) and  19 B (for cluster lasso prediction), the samples being produced from isolates of  Klebsiella pneumoniae  strains. It is noted that taking into account the sequencing depth of coverage, and thus an increasing copy number with the latter, makes it possible rapidly to obtain stable performance, from a depth of 30.  FIGS.  20  and  21    illustrate, through a simulation study, the effect of a metagenomic sample comprising  Staphylococcus aureus  strains (here simulating clinical samples from bronchoalveolar lavage) on the performance of a cluster-lasso prediction as a function of reads ( FIG.  20   ) or contigs ( FIG.  21   ) for the Illumina technology. Very fast stabilization at high performance depending on the actual sequencing depth of coverage of the  Staphylococcus aureus  strains present in the sample is also noted. 
     D.2. As Regards Other Features of the Embodiment 
     A particular embodiment of the invention has been described. This process may be modified in accordance with the following features, taken alone or in combination:
         prediction of susceptibility to an antibiotic has been described. The invention applies to any type of phenotype, for example the virulence of a bacterial strain, its ribotype, etc.;   the application of the invention to a biological sample taken from a patient has been described. The invention applies to any type of sample comprising bacteria, in particular a sample taken from an animal or a sample taken from the environment;   bacteria have been described. The invention also applies to yeasts and molds;   the complete sequencing of the bacterial genome has been described. As a variant, the genome sequencing is partial and targets one or more specific regions known to be involved in antibiotic susceptibility;   in the described embodiment, the value of k-mers and unitigs in the genome is binary (absence or presence) as encoded for example in the matrix X. As a variant, the value of k-mers or unitigs is equal to the number of copies thereof in the genome;   binary prediction (S and NS states) has been described. As a variant, the susceptibility is ordinal (higher number of states, e.g. S, R and I) or linear (e.g. prediction of the minimum inhibitory concentration, or “MIC”). In this case, the regression is ordinal or linear;   prediction models trained by logistic regression of the LASSO type have been described. Other parsimonious algorithms are possible, for instance random forest models, gradient boosting, set covering machine, aggregation and Monte-Carlo or deep learning, or any type of penalized Lasso learning (elastic-net, group-lasso, fused lasso, adaptive lasso, etc.);   selection of MAF units using a logistic regression lasso has been described. Other selections are possible, for example one as described in the article by Friedman J. H. “ Greedy Function Approximation: A Gradient Boosting Machine ”, The Annals of Statistics, 2001, and as used, for example, by the software “xGBoost”, available from the website https://xgboost.readthedocs.io/en/latest/, or any other nonlinear selection;   clustering based on Bravais-Pearson correlation values has been described. Other types of co-occurrence measurements are possible, for example a Jaccard or Sørensen-Dice distance;   a particular clustering has been described. Other types of clustering are possible, for example “standard” hierarchical clustering;   the value of a cluster has been described as being equal to the mean of the units constituting it. Other values are possible. For example, a logistic regression of the “lasso group” type is performed for each of the clusters in order to assign different weights to the different units constituting it;   the use of learning algorithms from assembled genomes has been described. As a variant, the invention applies directly to genomes produced by a sequencing platform, i.e. to genomes in the form of reads, optionally filtered from low quality reads.