Evidence map›Paper›PMID 39308639›Full record

ArticleProceedings. IEEE International Conference on Healthcare Informatics2024

An average-case efficient two-stage algorithm for enumerating all longest common substrings of minimum length

Mattia Prosperi, Simone Marini, Christina Boucher

Abstract read
In one paragraph

Article in Proceedings. IEEE International Conference on Healthcare Informatics, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Mattia Prosperidept. of Epidemiology, University of Florida, Gainesville, FL (USA).
Simone Marinidept. of Epidemiology, University of Florida, Gainesville, FL (USA).
Christina Boucherdept. of CISE, University of Florida, Gainesville, FL (USA).

Funding

Forecasting trajectories of HIV transmission networks with a novel phylodynamic and deep learning frameworkR01AI145552 · NIAID · UNIVERSITY OF FLORIDA · PI Simone Marini, Mattia Prosperi · 2020 to 2026
$3.6M
Developing Computational Methods for Surveillance of Antimicrobial Resistant AgentsR01AI141810 · NIAID · UNIVERSITY OF FLORIDA · PI BOUCHER, CHRISTINA, PROSPERI, MATTIA · 2019 to 2023
$2.1M
NIAID NIH HHS R01 AI141810NIAID NIH HHS R01 AI145552
6 · The paper itself

Abstract

A problem extension of the longest common substring (LCS) between two texts is the enumeration of all LCSs given a minimum length

Indexed as

AlgorithmsBioinformaticsBiological SequencesComputational Biology

Identifiers

PMID39308639
PMCPMC11412151

What Socratic holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.