On the public citation graph

Sparse Dynamic Programming on DAGs with Small Width

0 signed · 81 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.1006/jagm.1999.1063openalex-snapshot
Pattern Matching in Hypertext
inferredcites →https://doi.org/10.1007/3-540-60044-2_51openalex-snapshot
String matching in hypertext
inferredcites →https://doi.org/10.1007/978-3-319-07953-0_20openalex-snapshot
RRCA: Ultra-Fast Multiple In-species Genome Alignments
inferredcites →https://doi.org/10.1007/978-3-319-43681-4_20openalex-snapshot
A Graph Extension of the Positional Burrows-Wheeler Transform and Its Applications
inferredcites →https://doi.org/10.1007/978-3-319-89929-9_7openalex-snapshot
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
inferredcites →https://doi.org/10.1007/978-3-540-39763-2_33openalex-snapshot
Match Chaining Algorithms for cDNA Mapping
inferredcites →https://doi.org/10.1007/978-3-540-75530-2_1openalex-snapshot
A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences
inferredcites →https://doi.org/10.1007/978-3-642-40450-4_12openalex-snapshot
Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
inferredcites →https://doi.org/10.1007/978-3-662-04565-7openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0012-365x(75)90103-xopenalex-snapshot
On computing the length of longest increasing subsequences
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/j.ic.2010.04.003openalex-snapshot
Fast computation of a longest increasing subsequence and application
inferredcites →https://doi.org/10.1016/s0304-3975(99)00333-3openalex-snapshot
Improved approximate pattern matching on hypertext
inferredcites →https://doi.org/10.1023/b:orde.0000034609.99940.fbopenalex-snapshot
Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number
inferredcites →https://doi.org/10.1038/nbt.4227openalex-snapshot
Variation graph toolkit improves read mapping by representing genetic variation in the reference
inferredcites →https://doi.org/10.1038/nmeth.4197openalex-snapshot
Salmon provides fast and bias-aware quantification of transcript expression
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078334-6openalex-snapshot
Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1093/bib/bbw089openalex-snapshot
Computational pan-genomics: status, promises and challenges
inferredcites →https://doi.org/10.1093/bioinformatics/18.suppl_1.s181openalex-snapshot
Splicing graphs and EST assembly problem
inferredcites →https://doi.org/10.1101/043430openalex-snapshot
Computational Pan-Genomics: Status, Promises and Challenges
inferredcites →https://doi.org/10.1101/216127openalex-snapshot
Aligning sequences to general graphs in O ( V + mE ) time
inferredcites →https://doi.org/10.1109/bdcloud.2014.118openalex-snapshot
On the Graph Decomposition
inferredcites →https://doi.org/10.1109/icde.2008.4497498openalex-snapshot
An Efficient Algorithm for Answering Graph Reachability Queries
inferredcites →https://doi.org/10.1109/tcbb.2013.2297101openalex-snapshot
Indexing Graphs for Path Queries with Applications in Genome Research
inferredcites →https://doi.org/10.1109/tcbb.2015.2418753openalex-snapshot
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly
inferredcites →https://doi.org/10.1109/tkde.2016.2631160openalex-snapshot
Reachability Querying: Can It Be Even Faster?
inferredcites →https://doi.org/10.1109/tse.1979.234213openalex-snapshot
On Path Cover Problems in Digraphs and Applications to Program Testing
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0207011openalex-snapshot
An Algorithm for Transitive Closure with Linear Expected Time
inferredcites →https://doi.org/10.1137/070685373openalex-snapshot
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
inferredcites →https://doi.org/10.1137/1.9781611974768.2openalex-snapshot
Indexing Variation Graphs
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1142/9789812797919_0002openalex-snapshot
APPROXIMATE STRING MATCHING WITH ARBITRARY COSTS FOR TEXT AND HYPERTEXT
inferredcites →https://doi.org/10.1145/1082036.1082039openalex-snapshot
Indexing compressed text
inferredcites →https://doi.org/10.1145/146637.146650openalex-snapshot
Sparse dynamic programming I
inferredcites →https://doi.org/10.1145/146637.146656openalex-snapshot
Sparse dynamic programming II
inferredcites →https://doi.org/10.1145/1929934.1929941openalex-snapshot
Path-tree
inferredcites →https://doi.org/10.1145/2488608.2488705openalex-snapshot
Max flows in O(nm) time, or better
inferredcites →https://doi.org/10.1145/2591796.2591885openalex-snapshot
Linear time construction of compressed text indices in compact space
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/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems
inferredcites →https://doi.org/10.1145/99935.99944openalex-snapshot
A compression technique to materialize transitive closure
inferredcites →https://doi.org/10.1186/1471-2105-13-255openalex-snapshot
Normalized N50 assembly metric using gap-restricted co-linear chaining
inferredcites →https://doi.org/10.1186/1471-2105-15-s9-s5openalex-snapshot
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly
inferredcites →https://doi.org/10.1186/s12859-015-0530-3openalex-snapshot
YOC, A new strategy for pairwise alignment of collinear genomes
inferredcites →https://doi.org/10.1186/s12859-015-0533-0openalex-snapshot
A Long Fragment Aligner called ALFALFA
inferredcites →https://doi.org/10.1186/s12859-016-1103-9openalex-snapshot
Read mapping on de Bruijn graphs
inferredcites →https://doi.org/10.1186/s13059-015-0587-3openalex-snapshot
Extending reference assembly models
inferredcites →https://doi.org/10.14778/1920841.1920879openalex-snapshot
GRAIL
inferredcites →https://doi.org/10.5220/0004903502330238openalex-snapshot
Fast and Accurate cDNA Mapping and Splice Site Identification
inferredcites →https://doi.org/10.5555/313651.313661openalex-snapshot
Chaining multiple-alignment fragments in sub-quadratic time

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4890743openalex-extracted
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items Under a Common Preference Graph
inferred← citeshttps://doi.org/10.1007/978-1-0716-3989-4_36openalex-snapshot
Haplotype-Aware Sequence Alignment to Pangenome Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_20openalex-snapshot
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG
inferred← citeshttps://doi.org/10.1007/978-3-031-04749-7_15openalex-snapshot
Co-linear Chaining with Overlaps and Gap Costs
inferred← citeshttps://doi.org/10.1007/978-3-031-29119-7_4openalex-snapshot
Sequence to Graph Alignment Using Gap-Sensitive Co-linear Chaining
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_29openalex-snapshot
Chaining of Maximal Exact Matches in Graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2025.100913openalex-snapshot
Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114128openalex-snapshot
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114269openalex-snapshot
Elastic founder graphs improved and enhanced
inferred← citeshttps://doi.org/10.1089/cmb.2022.0266openalex-snapshot
Algorithms for Colinear Chaining with Overlaps and Gap Costs
inferred← citeshttps://doi.org/10.1089/cmb.2023.0186openalex-snapshot
Gap-Sensitive Colinear Chaining Algorithms for Acyclic Pangenome Graphs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad460openalex-snapshot
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae226openalex-snapshot
Label-guided seed-chain-extend alignment on annotated De Bruijn graphs
inferred← citeshttps://doi.org/10.1101/2022.11.04.514718openalex-snapshot
Label-guided seed-chain-extend alignment on annotated De Bruijn graphs
inferred← citeshttps://doi.org/10.1101/2023.06.21.545871openalex-snapshot
Co-linear Chaining on Pangenome Graphs
inferred← citeshttps://doi.org/10.1101/2023.11.15.566493openalex-snapshot
Haplotype-aware sequence alignment to pangenome graphs
inferred← citeshttps://doi.org/10.1101/2025.09.29.678807openalex-snapshot
Rapid, accurate long- and short-read mapping to large pangenome graphs with vg Giraffe
inferred← citeshttps://doi.org/10.1101/gr.279143.124openalex-snapshot
Haplotype-aware sequence alignment to pangenome graphs
inferred← citeshttps://doi.org/10.1109/tcbb.2021.3131203openalex-snapshot
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG
inferred← citeshttps://doi.org/10.1137/1.9781611977073.18openalex-snapshot
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time
inferred← citeshttps://doi.org/10.1145/3637528.3671757openalex-snapshot
Max-Min Diversification with Asymmetric Distances
inferred← citeshttps://doi.org/10.1145/3697090.3697100openalex-snapshot
Selecting Blockchain Consensus Algorithms Integrations for IoT-based Enviroments
inferred← citeshttps://doi.org/10.1186/s13015-024-00250-wopenalex-snapshot
Co-linear chaining on pangenome graphs
inferred← citeshttps://doi.org/10.1186/s13059-025-03606-6openalex-snapshot
A survey of sequence-to-graph mapping algorithms in the pangenome era
inferred← citeshttps://doi.org/10.3389/fbinf.2024.1391086openalex-snapshot
Maximum-scoring path sets on pangenome graphs of constant treewidth
inferred← citeshttps://doi.org/10.3390/computation8040103openalex-snapshot
Graph Reachability on Parallel Many-Core Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.2007.07575openalex-snapshot
A linear-time parameterized algorithm for computing the width of a DAG
inferred← citeshttps://doi.org/10.5753/jisa.2026.5926openalex-snapshot
Selecting Consensus Algorithm Integrations in a DAG-based Blockchain for IoT Using Genetic Algorithms
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.