Evidence map›Paper›PMID 42026667›Full record

ArticleGenome biology2026

LCPAN: efficient variation graph construction using locally consistent parsing.

Akmuhammet Ashyralyyev, Zülal Bingöl, Begüm Filiz Öz, Kaiyuan Zhu, Salem Malikic, Uzi Vishkin, S Cenk Sahinalp, Can Alkan

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Genome biology, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing 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

1 citing paper in PubMed.

  1. GenCore: Genomic distance estimation using Locally Consistent Parsing.bioRxiv : the preprint server for biology · 2026
    Article
4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

8 authors.

Akmuhammet AshyralyyevDept of Computer Engineering, Bilkent University, Ankara, 06800, Turkey.
Zülal BingölDept of Computer Engineering, Bilkent University, Ankara, 06800, Turkey.
Begüm Filiz ÖzDept of Computer Engineering, Bilkent University, Ankara, 06800, Turkey.
Kaiyuan ZhuDepartment of Computer Science and Engineering, University of California San Diego, La Jolla, 92093, CA, USA.
Salem MalikicCancer Data Science Laboratory, Center for Cancer Research, National Cancer Institute, National Institutes of Health, Bethesda, 20892, MD, USA.
Uzi VishkinUniversity of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, 20742, MD, USA.
S Cenk SahinalpCancer Data Science Laboratory, Center for Cancer Research, National Cancer Institute, National Institutes of Health, Bethesda, 20892, MD, USA. cenk.sahinalp@nih.gov.
Can AlkanDept of Computer Engineering, Bilkent University, Ankara, 06800, Turkey. calkan@cs.bilkent.edu.tr.

Funding

HORIZON EUROPE European Innovation Council 101047160
6 · The paper itself

Abstract

Efficient and consistent string processing is critical in the exponentially growing genomic data era. Locally Consistent Parsing (LCP) addresses this need by partitioning an input genome string into short, exactly matching substrings ("cores"), ensuring consistency across partitions. Compared to the popular sketching techniques, LCP produces fewer cores, enabling a more compact representation and faster analyses. Here, we present the first iterative implementation of LCP with LCPTOOLS and introduce LCPAN, an efficient variation graph constructor, which we show generates variation graphs >12

Indexed as

GenomicsSoftwareAlgorithmsGenome representationLocally consistent parsingVariation graph

Identifiers

PMID42026667
PMCPMC13270696

What Socratic holds

Textmetadata
LicenceCC BY
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.