The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Global optimal eBURST analysis of multilocus typing data using a graphic matroid approach
Open accessAbstract
Background: Multilocus Sequence Typing (MLST) is a frequently used typing method for the analysis of the clonal relationships among strains of several clinically relevant microbial species. MLST is based on the sequence of housekeeping genes that result in each strain having a distinct numerical allelic profile, which is abbreviated to a unique identifier: the sequence type (ST). The relatedness between two strains can then be inferred by the differences between allelic profiles. For a more comprehensive analysis of the possible patterns of evolutionary descent, a set of rules were proposed and implemented in the eBURST algorithm. These rules allow the division of a data set into several clusters of related strains, dubbed clonal complexes, by implementing a simple model of clonal expansion and diversification. Within each clonal complex, the rules identify which links between STs correspond to the most probable pattern of descent. However, the eBURST algorithm is not globally optimized, which can result in links, within the clonal complexes, that violate the rules proposed. Results: Here, we present a globally optimized implementation of the eBURST algorithm – goeBURST. The search for a global optimal solution led to the formalization of the problem as a graphic matroid, for which greedy algorithms that provide an optimal solution exist. Several public data sets of MLST data were tested and differences between the two implementations were found and are discussed for five bacterial species: Enterococcus faecium, Streptococcus pneumoniae, Burkholderia pseudomallei, Campylobacter jejuni and Neisseria spp.. A novel feature implemented in goeBURST is the representation of the level of tiebreak rule reached before deciding if a link should be drawn, which can used to visually evaluate the reliability of the represented hypothetical pattern of descent. Conclusion: goeBURST is a globally optimized implementation of the eBURST algorithm, that identifies alternative patterns of descent for several bacterial species. Furthermore, the algorithm can be applied to any multilocus typing data based on the number of differences between numeric profiles. A software implementation is available at http://goeBURST.phyloviz.net.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
The Proceedings of the National Academy of Sciences
Richards, J. W. (1915) · Science · doi:10.1126/science.42.1074.161 · Cited by 13,983
Application of Phylogenetic Networks in Evolutionary Studies
Huson, D. H., & Bryant, D. (2006) · Molecular Biology and Evolution · doi:10.1093/molbev/msj030 · Cited by 8,830
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Maiden, M. C. J., Bygraves, J. A., Feil, E., Morelli, G., Russell, J. E., Urwin, R., Zhang, Q., Zhou, J., Zurth, K., Caugant, D. A., et al. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.6.3140 · Cited by 3,833
(2003) · Selected Papers of Alan J Hoffman · doi:10.1142/9789812796936_others05 · Cited by 2,465
Feil, E. J., Li, B. C., Aanensen, D. M., Hanage, W. P., & Spratt, B. G. (2004) · Journal of Bacteriology · doi:10.1128/jb.186.5.1518-1530.2004 · Cited by 1,861
The evolutionary history of methicillin-resistant Staphylococcus aureus (MRSA)
Enright, M. C., Robinson, D. A., Randle, G., Feil, E. J., Grundmann, H., & Spratt, B. G. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122108599 · Cited by 1,588
Re-evaluating prokaryotic species
Gevers, D., Cohan, F. M., Lawrence, J. G., Spratt, B. G., Coenye, T., Feil, E. J., Stackebrandt, E., de Peer, Y. V., Vandamme, P., Thompson, F. L., et al. (2005) · Nature Reviews Microbiology · doi:10.1038/nrmicro1236 · Cited by 1,122
Enright, M. C., & Spratt, B. G. (1998) · Microbiology · doi:10.1099/00221287-144-11-3049 · Cited by 1,074
Cited by
BIGSdb: Scalable analysis of bacterial genome variation at the population level
Jolley, K. A., & Maiden, M. C. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-595 · Cited by 2,368
GrapeTree: visualization of core genomic relationships among 100,000 bacterial pathogens
Zhou, Z., Alikhan, N.-F., Sergeant, M. J., Luhmann, N., Vaz, C., Francisco, A. P., Carriço, J. A., & Achtman, M. (2018) · Genome Research · doi:10.1101/gr.232397.117 · Cited by 1,060
Self-citationPHYLOViZ: phylogenetic inference and data visualization for sequence based typing methods
Francisco, A. P., Vaz, C., Monteiro, P. T., Melo-Cristino, J., Ramirez, M., & Carriço, J. A. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-87 · Cited by 563
Self-citationNascimento, M., Sousa, A., Ramirez, M., Francisco, A. P., Carriço, J. A., & Vaz, C. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btw582 · Cited by 453
Self-citationGlobal Emergence and Dissemination of Enterococci as Nosocomial Pathogens: Attack of the Clones?
Guzman Prieto, A. M., van Schaik, W., Rogers, M. R. C., Coque, T. M., Baquero, F., Corander, J., & Willems, R. J. L. (2016) · Frontiers in Microbiology · doi:10.3389/fmicb.2016.00788 · Cited by 385
Metadata
- Authors
- Francisco, A. P., Bugalho, M., Ramirez, M., & Carriço, J. A.
- Venue
- BMC Bioinformatics
- Published
- 2009-05-18
- Volume
- 10
- Issue
- 1
- Pages
- 152-152
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W1999417916
- Cited by
- 626
- References
- 34
- FWCI
- 5.52
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Global optimal eBURST analysis of multilocus typing data using a graphic matroid approach. https://app.cochat.ai/papers/10.1186/1471-2105-10-152
- The paper
- Francisco, A. P., Bugalho, M., Ramirez, M., & Carriço, J. A. (2009). Global optimal eBURST analysis of multilocus typing data using a graphic matroid approach. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-10-152
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.