Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
Andrea Cracco, Alexandru I. Tomescu
Genome Research (2023)
Open Access | Times Cited: 30

Showing 1-25 of 30 citing articles:

Fulgor: a fast and compact k-mer index for large-scale matching and color queries
Jason Fan, Jamshed Khan, Noor Singh, et al.
Algorithms for Molecular Biology (2024) Vol. 19, Iss. 1
Open Access | Times Cited: 20
AllTheBacteria - all bacterial genomes assembled, available and searchable
Martin Hunt, Leandro Lima, D.P. Anderson, et al.
bioRxiv (Cold Spring Harbor Laboratory) (2024)
Open Access | Times Cited: 16
Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes
Jarno Alanko, Jaakko Vuohtoniemi, Tommi Mäklin, et al.
Bioinformatics (2023) Vol. 39, Iss. Supplement_1, pp. i260-i269
Open Access | Times Cited: 31
Indexing All Life’s Known Biological Sequences
Mikhail Karasikov, Harun Mustafa, Daniel Danciu, et al.
bioRxiv (Cold Spring Harbor Laboratory) (2020)
Open Access | Times Cited: 44
Efficient data reconstruction: The bottleneck of large-scale application of DNA storage
Ben Cao, Yanfen Zheng, Qi Shao, et al.
Cell Reports (2024) Vol. 43, Iss. 4, pp. 113699-113699
Open Access | Times Cited: 5
When less is more: sketching with minimizers in genomics
Malick Ndiaye, Silvia Prieto-Baños, Lucy Fitzgerald, et al.
Genome biology (2024) Vol. 25, Iss. 1
Open Access | Times Cited: 5
Indexing and real-time user-friendly queries in terabyte-sized complex genomic datasets with kmindex and ORA
Téo Lemane, Nolan Lezzoche, Julien Lecubin, et al.
Nature Computational Science (2024) Vol. 4, Iss. 2, pp. 104-109
Open Access | Times Cited: 4
Computational genomics: finding out mystery of whole genome
Shripad Mukund Upasani
Elsevier eBooks (2025), pp. 125-149
Closed Access
The open-closed mod-minimizer algorithm
Ragnar Groot Koerkamp, Daniel Liu, Giulio Ermanno Pibiri
Algorithms for Molecular Biology (2025) Vol. 20, Iss. 1
Open Access
Matchtigs: minimum plain text representation of k-mer sets
Sebastian Schmidt, Shahbaz Khan, Jarno Alanko, et al.
Genome biology (2023) Vol. 24, Iss. 1
Open Access | Times Cited: 9
Fulgor: A fast and compactk-mer index for large-scale matching and color queries
Jason Fan, Noor Singh, Jamshed Khan, et al.
bioRxiv (Cold Spring Harbor Laboratory) (2023)
Open Access | Times Cited: 4
Finimizers: Variable-length bounded-frequency minimizers fork-mer sets
Jarno Alanko, Elena Biagi, Simon J. Puglisi
bioRxiv (Cold Spring Harbor Laboratory) (2024)
Open Access | Times Cited: 1
The mod-minimizer: a simple and efficient sampling algorithm for long k-mers
Ragnar Groot Koerkamp, Giulio Ermanno Pibiri
bioRxiv (Cold Spring Harbor Laboratory) (2024)
Open Access | Times Cited: 1
Hyper-k-mers: efficient streaming k-mers representation
Igor Martayan, Lucas Robidou, Yoshihiro Shibuya, et al.
bioRxiv (Cold Spring Harbor Laboratory) (2024)
Open Access | Times Cited: 1
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time
Sebastian Schmidt, Jarno Alanko
Algorithms for Molecular Biology (2023) Vol. 18, Iss. 1
Open Access | Times Cited: 3
The Backpack Quotient Filter: a dynamic and space-efficient data structure for queryingk-mers with abundance.
Victor Levallois, Francesco Andreace, Bertrand Le Gal, et al.
bioRxiv (Cold Spring Harbor Laboratory) (2024)
Open Access
Compression algorithm for colored de Bruijn graphs
Amatur Rahman, Yoann Dufresne, Paul Medvedev
Algorithms for Molecular Biology (2024) Vol. 19, Iss. 1
Open Access
Pangenome-spanning epistasis and coselection analysis via de Bruijn graphs
Juri Kuronen, Samuel Horsfield, Anna K. Pöntinen, et al.
Genome Research (2024) Vol. 34, Iss. 7, pp. 1081-1088
Open Access
Back to sequences: Find the origin of k-mers
Anthony Baire, Pierre Marijon, Francesco Andreace, et al.
The Journal of Open Source Software (2024) Vol. 9, Iss. 101, pp. 7066-7066
Open Access
Graphite: painting genomes using a colored de Bruijn graph
Rick Beeloo, Aldert Zomer, Sebastian Deorowicz, et al.
NAR Genomics and Bioinformatics (2024) Vol. 6, Iss. 4
Open Access
The open-closed mod-minimizer algorithm
Ragnar Groot Koerkamp, Daniel Liu, Giulio Ermanno Pibiri
bioRxiv (Cold Spring Harbor Laboratory) (2024)
Open Access
The Backpack Quotient Filter: a dynamic and space-efficient data structure for querying k-mers with abundance
Victor Levallois, Francesco Andreace, Bertrand Le Gal, et al.
iScience (2024) Vol. 27, Iss. 12, pp. 111435-111435
Open Access
Brisk: Exact resource-efficient dictionary for k-mers
Carol Smith, Igor Martayan, Antoine Limasset, et al.
bioRxiv (Cold Spring Harbor Laboratory) (2024)
Open Access
Back to sequences: find the origin of kmers
Anthony Baire, Pierre Peterlongo
(2023)
Open Access | Times Cited: 1
KombOver: Efficient k-core and K-truss based characterization of perturbations within the human gut microbiome
Nicolae Sapoval, Marko Tanevski, Todd J. Treangen
Biocomputing (2023), pp. 506-520
Closed Access | Times Cited: 1
Page 1 - Next Page

Scroll to top