On the public citation graph
AllSome Sequence Bloom Trees
0 signed · 42 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.20208openalex-snapshot
Less hashing, same performance: Building a better Bloom filter
inferredcites →https://doi.org/10.1002/spe.2325openalex-snapshot
Better bitmap performance with Roaring bitmaps
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_28openalex-snapshot
From Theory to Practice: Plug and Play with Succinct Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-40453-5_28openalex-snapshot
Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs
inferredcites →https://doi.org/10.1007/978-3-662-48221-6_16openalex-snapshot
Bloom Filter Trie – A Data Structure for Pan-Genome Storage
inferredcites →https://doi.org/10.1016/j.cels.2015.08.004openalex-snapshot
Entropy-Scaling Search of Massive Biological Data
inferredcites →https://doi.org/10.1016/j.is.2015.01.002openalex-snapshot
Bloofi: Multidimensional Bloom filters
inferredcites →https://doi.org/10.1017/cbo9781139940023openalex-snapshot
Genome-Scale Algorithm Design
inferredcites →https://doi.org/10.1023/a:1009934302807openalex-snapshot
Adding Compression to Block Addressing Inverted Indexes
inferredcites →https://doi.org/10.1038/nbt.2862openalex-snapshot
Sailfish enables alignment-free isoform quantification from RNA-seq reads using lightweight algorithms
inferredcites →https://doi.org/10.1038/nbt.3442openalex-snapshot
Fast search of thousands of short-read sequencing experiments
inferredcites →https://doi.org/10.1038/nbt.3519openalex-snapshot
Near-optimal probabilistic RNA-seq quantification
inferredcites →https://doi.org/10.1038/nmeth.1923openalex-snapshot
Fast gapped-read alignment with Bowtie 2
inferredcites →https://doi.org/10.1038/nprot.2012.016openalex-snapshot
Differential gene and transcript expression analysis of RNA-seq experiments with TopHat and Cufflinks
inferredcites →https://doi.org/10.1093/bib/bbw089openalex-snapshot
Computational pan-genomics: status, promises and challenges
inferredcites →https://doi.org/10.1093/bioinformatics/bth078openalex-snapshot
Open source clustering software
inferredcites →https://doi.org/10.1093/bioinformatics/btq230openalex-snapshot
Classification of DNA sequences using Bloom filters
inferredcites →https://doi.org/10.1093/bioinformatics/btr011openalex-snapshot
A fast, lock-free approach for efficient parallel counting of occurrences of k -mers
inferredcites →https://doi.org/10.1093/bioinformatics/btu030openalex-snapshot
BLESS: Bloom filter-based error correction solution for high-throughput sequencing reads
inferredcites →https://doi.org/10.1093/bioinformatics/btu756openalex-snapshot
SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips
inferredcites →https://doi.org/10.1093/bioinformatics/btv603openalex-snapshot
Graphical pan-genome analysis with compressed suffix trees and the Burrows–Wheeler transform
inferredcites →https://doi.org/10.1093/bioinformatics/btw266openalex-snapshot
deBWT: parallel construction of Burrows–Wheeler Transform for large collection of genomes with de Bruijn-branch encoding
inferredcites →https://doi.org/10.1093/bioinformatics/btw575openalex-snapshot
Rail-RNA: scalable analysis of RNA-seq splicing and coverage
inferredcites →https://doi.org/10.1093/bioinformatics/btw609openalex-snapshot
TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes
inferredcites →https://doi.org/10.1101/060186openalex-snapshot
Using reference-free compressed data structures to analyse sequencing reads from thousands of human genomes
inferredcites →https://doi.org/10.1109/2.881693openalex-snapshot
Compression: a key for next-generation text retrieval systems
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1186/1471-2105-12-333openalex-snapshot
Efficient counting of k-mers in DNA sequences using a bloom filter
inferredcites →https://doi.org/10.1186/1471-2105-15-1openalex-snapshot
New mini- zincin structures provide a minimal scaffold for members of this metallopeptidase superfamily
inferredcites →https://doi.org/10.1186/1748-7188-8-22openalex-snapshot
Space-efficient and exact de Bruijn graph representation based on a Bloom filter
inferredcites →https://doi.org/10.1371/journal.pcbi.1005727openalex-snapshot
kWIP: The k-mer weighted inner product, a de novo estimator of genetic similarity
inferredcites →https://doi.org/10.48550/arxiv.1605.08319openalex-snapshot
A resource-frugal probabilistic dictionary and applications in (meta)genomics
inferredcites →https://doi.org/10.6084/m9.figshare.963153.v1openalex-snapshot
Aligning sequence reads, clone sequences and assembly con*gs with BWA-MEM
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.isci.2021.102782openalex-snapshot
Raptor: A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences
inferred← citeshttps://doi.org/10.1093/bioinformatics/btz350openalex-snapshot
Building large updatable colored de Bruijn graphs via merging
inferred← citeshttps://doi.org/10.1145/3490422.3502366openalex-snapshot
Co-Design for Energy Efficient and Fast Genomic Search
inferred← citeshttps://doi.org/10.1186/s13059-023-02971-4openalex-snapshot
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries
inferred← citeshttps://doi.org/10.48550/arxiv.1903.12312openalex-snapshot
Data structures to represent a set of k-long DNA sequences
showing the first 5 of 6 · page through all 6
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.