Whole-genome sequencing-based typing methods for <i>Clostridium butyricum</i> strains from clinical, animal, plant, and environmental sources. [PDF]
Cassir N +10 more
europepmc +1 more source
Genomic analysis of <i>Klebsiella aerogenes</i> circulating in New Mexico. [PDF]
Huggins LM +8 more
europepmc +1 more source
Prevalence, bacterial load, and genomic characterization of <i>Vibrio parahaemolyticus</i> in freshwater-farmed <i>Litopenaeus vannamei</i> from China. [PDF]
Shan F +11 more
europepmc +1 more source
Whole-genome sequencing for surveillance of <i>Salmonella</i> at a public health institution in South Africa. [PDF]
Smith AM +8 more
europepmc +1 more source
Unsignalized intersection vehicle platoon formation scheduling method based on mixed traffic. [PDF]
Jiang J, Rui Y, Ran B.
europepmc +1 more source
Correction: Prevalence, bacterial load, and genomic characterization of <i>Vibrio parahaemolyticus</i> in freshwater-farmed <i>Litopenaeus vannamei</i> from China. [PDF]
Shan F +11 more
europepmc +1 more source
Radiation Pneumonitis Risk Assessment Using Fractal Analyses in NSCLC Patients Treated with Curative-Intent Radiotherapy. [PDF]
Hwang J +6 more
europepmc +1 more source
Optimizing solar farm interconnection networks using graph theory and metaheuristic algorithms with economic and reliability analysis. [PDF]
Ghias-Nodoushan A +3 more
europepmc +1 more source
Related searches:
Finding Minimum Spanning Trees
SIAM Journal on Computing, 1976This paper studies methods for finding minimum spanning trees in graphs. Results include 1. several algorithms with $O(m\log \log n)$ worst-case running times, where n is the number vertices and m is the number of edges in the problem graph; 2. an $O(m)$ worst-case algorithm for dense graphs (those for which m is $\Omega (n^{1 + \varepsilon } )$ for ...
Cheriton, David, Tarjan, Robert Endre
openaire +2 more sources

