Construction of edit-distance graphs for large sets of short reads through minimizer-bucketing

Authors

Jinyan Li (ORCID: https://orcid.org/0000-0003-1833-7413)
Pengyao Ping (ORCID: https://orcid.org/0000-0002-1829-3273)

Institutions

University of Technology Sydney (AU)
Information Technology University (PK)
Shenzhen University (CN)
Shenzhen Technology University (CN)

Publication Details

Journal: Bioinformatics Advances
Published: 2024-12-26
DOI: https://doi.org/10.1093/bioadv/vbaf081
Primary Topic: Algorithms and Data Compression
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Construction of edit-distance graphs for large sets of short reads through minimizer-bucketing

Jinyan Li, Pengyao Ping

Dec 26, 2024

Bioinformatics Advances

Algorithms and Data Compression

article

Construction of edit-distance graphs for large sets of short reads through minimizer-bucketing

Jinyan Li, Pengyao Ping

December 26, 2024article en

Abstract

No abstract available for this paper.

Bioinformatics AdvancesVol. 5(1)

University of Technology Sydney (AU), Information Technology University (PK), Shenzhen University (CN), Shenzhen Technology University (CN)

Openalex Percentile: Top 73%

Algorithms and Data Compression

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Construction of edit-distance graphs for large sets of short reads through minimizer-bucketing — Jinyan Li, Pengyao Ping · Bioinformatics Advances (2024) | TGRS Research Map | TGRS