Faster computation of left-bounded shortest unique substrings
Finding shortest unique substrings (SUS) is a fundamental problem in string processing with applications in bioinformatics. In this paper, we present an algorithm for solving a variant of the SUS problem, the left-bounded shortest unique substrings (LSUS)
Larissa L. M. Aguiar, Felipe A. Louza
doaj +1 more source
String Processing and Information Retrieval
The 31st International Symposium on String Processing and Information Retrieval (SPIRE) was held on September 23–25, 2024, in Puerto Vallarta (Mexico), followed by the 18th Workshop on Compression, Text, and Algorithms (WCTA) held on September 26, 2024.
Zsuzsanna Liptak +3 more
openaire +2 more sources
Material Preparation Information File (MPIF): A Community-Driven Standard for Reporting MOF Syntheses. [PDF]
Cheung O +10 more
europepmc +1 more source
A Dataset of Fatigue Properties for Welded Joints. [PDF]
Deng C +6 more
europepmc +1 more source
Proteomic Analysis of Regulated Dendritic Cell Endosomes Reveals Dynamic Adaptation to Antigen Uptake and Cross-Presentation. [PDF]
Senni A +7 more
europepmc +1 more source
LCSkPOA: enabling banded semi-global partial order alignments via efficient and accurate backbone generation through extended LCSk+. [PDF]
Weerakoon M, Saunders CT, Heaton H.
europepmc +1 more source
Clinical Presentation, Genetics, and Laboratory Testing with Integrated Genetic Analysis of Molecular Mechanisms in Prader-Willi and Angelman Syndromes: A Review. [PDF]
Butler MG.
europepmc +1 more source
Patient address parsing via KG-aware contrastive learning and constrained on-prem LLM inference. [PDF]
Li J, Pan X, Jia Y.
europepmc +1 more source
Text-mined dataset of solid-state syntheses with impurity phases using Large Language Model. [PDF]
Lee S +4 more
europepmc +1 more source

