On the public citation graph

Aligning sequences to general graphs in O ( V + mE ) time

0 signed · 48 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/0471250953.bi0305s43openalex-snapshot
Selecting the Right Similarity‐Scoring Matrix
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0022-2836(70)90057-4openalex-snapshot
A general method applicable to the search for similarities in the amino acid sequence of two proteins
inferredcites →https://doi.org/10.1016/0022-2836(81)90087-5openalex-snapshot
Identification of common molecular subsequences
inferredcites →https://doi.org/10.1016/0022-2836(82)90398-9openalex-snapshot
An improved algorithm for matching biological sequences
inferredcites →https://doi.org/10.1016/0196-6774(80)90016-4openalex-snapshot
The theory and computation of evolutionary distances: Pattern recognition
inferredcites →https://doi.org/10.1016/0196-6774(85)90023-9openalex-snapshot
Finding approximate patterns in strings
inferredcites →https://doi.org/10.1016/j.ygeno.2010.03.001openalex-snapshot
Assembly algorithms for next-generation sequencing data
inferredcites →https://doi.org/10.1016/s0019-9958(85)80046-2openalex-snapshot
Algorithms for approximate string matching
inferredcites →https://doi.org/10.1038/nbt.2023openalex-snapshot
How to apply de Bruijn graphs to genome assembly
inferredcites →https://doi.org/10.1089/cmb.1995.2.275openalex-snapshot
Toward Simplifying and Accurately Formulating Fragment Assembly
inferredcites →https://doi.org/10.1089/cmb.2017.0264openalex-snapshot
Sequence Alignment on Directed Graphs
inferredcites →https://doi.org/10.1093/bib/bbw089openalex-snapshot
Computational pan-genomics: status, promises and challenges
inferredcites →https://doi.org/10.1093/bioinformatics/13.1.45openalex-snapshot
Reduced space sequence alignment
inferredcites →https://doi.org/10.1093/bioinformatics/18.3.452openalex-snapshot
Multiple sequence alignment using partial order graphs
inferredcites →https://doi.org/10.1093/bioinformatics/btt215openalex-snapshot
Short read alignment with populations of genomes
inferredcites →https://doi.org/10.1093/bioinformatics/btu538openalex-snapshot
LoRDEC: accurate and efficient long read error correction
inferredcites →https://doi.org/10.1093/bioinformatics/btv688openalex-snapshot
hybrid SPA des : an algorithm for hybrid assembly of short and long reads
inferredcites →https://doi.org/10.1101/gr.214155.116openalex-snapshot
Genome graphs and the evolution of genome inference
inferredcites →https://doi.org/10.1109/jproc.2015.2455551openalex-snapshot
Short Read Mapping: An Algorithmic Tour
inferredcites →https://doi.org/10.1145/2746539.2746612openalex-snapshot
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
inferredcites →https://doi.org/10.1145/299432.299460openalex-snapshot
q -gram based database searching using a suffix array (QUASAR)
inferredcites →https://doi.org/10.1145/316542.316550openalex-snapshot
A fast bit-vector algorithm for approximate string matching based on dynamic programming
inferredcites →https://doi.org/10.1186/1471-2105-15-99openalex-snapshot
Genome alignment with graph data structures: a comparison
inferredcites →https://doi.org/10.1186/gb-2009-10-9-r98openalex-snapshot
Simultaneous alignment of short reads against multiple genomes
inferredcites →https://doi.org/10.1186/s12859-016-1103-9openalex-snapshot
Read mapping on de Bruijn graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-17083-7_6openalex-snapshot
On the Complexity of Sequence to Graph Alignment
inferred← citeshttps://doi.org/10.1007/978-3-030-45257-5_7openalex-snapshot
AStarix: Fast and Optimal Sequence-to-Graph Alignment
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_15openalex-snapshot
Walk-Preserving Transformation of Overlapped Sequence Graphs into Blunt Sequence Graphs with GetBlunted
inferred← citeshttps://doi.org/10.1007/978-3-031-04749-7_16openalex-snapshot
The Complexity of Approximate Pattern Matching on de Bruijn Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-36805-9_11openalex-snapshot
Heuristics for the de Bruijn Graph Sequence Mapping Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_18openalex-snapshot
Fast Pattern Matching with Epsilon Transitions
inferred← citeshttps://doi.org/10.1007/s00453-022-00989-xopenalex-snapshot
Solving String Problems on Graphs Using the Labeled Direct Product
inferred← citeshttps://doi.org/10.1007/s00453-022-01007-wopenalex-snapshot
Algorithms and Complexity on Indexing Founder Graphs
inferred← citeshttps://doi.org/10.1007/s11786-020-00496-8openalex-snapshot
Compositional Properties of Alignments
inferred← citeshttps://doi.org/10.1089/cmb.2019.0066openalex-snapshot
On the Complexity of Sequence-to-Graph Alignment
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae757openalex-snapshot
Fast and exact gap-affine partial order alignment with POASTA
inferred← citeshttps://doi.org/10.1093/bioinformatics/bty279openalex-snapshot
A graph-based approach to diploid genome assembly
inferred← citeshttps://doi.org/10.1101/2020.01.22.915496openalex-snapshot
AStarix: Fast and Optimal Sequence-to-Graph Alignment
inferred← citeshttps://doi.org/10.1101/2022.10.27.513962openalex-snapshot
RecGraph: adding recombinations to sequence-to-graph alignments
inferred← citeshttps://doi.org/10.1101/682799openalex-snapshot
Validating Paired-end Read Alignments in Sequence Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611976496.26openalex-snapshot
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
inferred← citeshttps://doi.org/10.1145/3301312openalex-snapshot
Sparse Dynamic Programming on DAGs with Small Width
inferred← citeshttps://doi.org/10.1145/3588334openalex-snapshot
On the Complexity of String Matching for Graphs
inferred← citeshttps://doi.org/10.1146/annurev-genom-120219-080406openalex-snapshot
Pangenome Graphs
inferred← citeshttps://doi.org/10.1186/s13059-021-02473-1openalex-snapshot
Pandora: nucleotide-resolution bacterial pan-genomics with reference graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1810.07800openalex-snapshot
Alignments as Compositional Structures
inferred← citeshttps://doi.org/10.5753/etc.2026.21957openalex-snapshot
Algoritmo para Alinhamento de Sequências em Grafos de Sequências com Economia de Espaço
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.