On the public citation graph
Streaming K-Mismatch with Error Correcting and Applications
0 signed · 50 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.1007/11780441_33openalex-snapshot
Approximate Matching in Weighted Sequences
inferredcites →https://doi.org/10.1007/978-3-319-23660-5_7openalex-snapshot
Linear-Time Computation of Prefix Table for Weighted Strings
inferredcites →https://doi.org/10.1007/978-3-540-73437-6_19openalex-snapshot
Improved Sketching of Hamming Distance with Error Correcting
inferredcites →https://doi.org/10.1007/978-3-642-21458-5_15openalex-snapshot
Real-Time Streaming String-Matching
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_31openalex-snapshot
Dictionary Matching in a Stream
inferredcites →https://doi.org/10.1007/s00224-018-9881-2openalex-snapshot
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
inferredcites →https://doi.org/10.1016/0304-3975(79)90039-2openalex-snapshot
7th international colloquium on automata, languages and programming
inferredcites →https://doi.org/10.1016/j.ic.2010.12.007openalex-snapshot
A black box for online approximate pattern matching
inferredcites →https://doi.org/10.1016/j.ic.2019.104462openalex-snapshot
Indexing weighted sequences: Neat and efficient
inferredcites →https://doi.org/10.1016/j.tcs.2008.01.006openalex-snapshot
Property matching and weighted matching
inferredcites →https://doi.org/10.1016/j.tcs.2008.01.015openalex-snapshot
Fast profile matching algorithms — A survey
inferredcites →https://doi.org/10.1016/j.tcs.2012.06.012openalex-snapshot
Space lower bounds for online pattern matching
inferredcites →https://doi.org/10.1016/j.tcs.2016.04.029openalex-snapshot
Linear-time computation of prefix table for weighted strings & applications
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0174934-9openalex-snapshot
Uniqueness Theorems for Periodic Functions
inferredcites →https://doi.org/10.1093/nar/gkh012openalex-snapshot
JASPAR: an open-access database for eukaryotic transcription factor binding profiles
inferredcites →https://doi.org/10.1109/dcc.2017.14openalex-snapshot
Streaming K-Mismatch with Error Correcting and Applications
inferredcites →https://doi.org/10.1109/dcc41552.2018openalex-snapshot
2018 Data Compression Conference
inferredcites →https://doi.org/10.1109/focs.2009.11openalex-snapshot
Exact and Approximate Pattern Matching in the Streaming Model
inferredcites →https://doi.org/10.1109/focs16189.2009openalex-snapshot
2009 50th Annual IEEE Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1109/mcg.1986.276611openalex-snapshot
25th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
inferredcites →https://doi.org/10.1137/1.9781611974331openalex-snapshot
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
inferredcites →https://doi.org/10.1137/1.9781611974331.ch142openalex-snapshot
The k-mismatch problem revisited
inferredcites →https://doi.org/10.1137/1.9781611975482openalex-snapshot
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
inferredcites →https://doi.org/10.1137/1.9781611975482.68openalex-snapshot
The streaming k-mismatch problem
inferredcites →https://doi.org/10.1145/2452376openalex-snapshot
Proceedings of the 16th International Conference on Extending Database Technology
inferredcites →https://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferredcites →https://doi.org/10.3233/fun-2006-712-307openalex-snapshot
The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications
inferredcites →https://doi.org/10.4230/lipics.cpm.2016.4openalex-snapshot
Efficient Index for Weighted Sequences
inferredcites →https://doi.org/10.4230/lipics.esa.2017.41openalex-snapshot
Real-Time Streaming Multi-Pattern Search for Constant Alphabet
inferredcites →https://doi.org/10.4230/lipics.icalp.2016.20openalex-snapshot
Approximate Hamming Distance in a Stream
inferredcites →https://doi.org/10.4230/lipics.icalp.2018.65openalex-snapshot
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
inferredcites →https://doi.org/10.48550/arxiv.1504.06242openalex-snapshot
Dictionary matching in a stream
inferredcites →https://doi.org/10.48550/arxiv.1509.08608openalex-snapshot
Probabilistic Threshold Indexing for Uncertain Strings
inferredcites →https://doi.org/10.48550/arxiv.1602.07241openalex-snapshot
Approximate Hamming distance in a stream
inferredcites →https://doi.org/10.5555/3310435.3310503openalex-snapshot
The streaming k-mismatch problem
inferredcites →https://doi.org/10.6064/2012/917540openalex-snapshot
Position Weight Matrix, Gibbs Sampler, and the Associated Significance Tests in Motif Characterization and Prediction
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-32686-9_16openalex-snapshot
Weighted Shortest Common Supersequence Problem Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_9openalex-snapshot
Periodicity in Data Streams with Wildcards
inferred← citeshttps://doi.org/10.1007/s00224-018-9881-2openalex-snapshot
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
inferred← citeshttps://doi.org/10.1007/s00224-019-09950-yopenalex-snapshot
Periodicity in Data Streams with Wildcards
inferred← citeshttps://doi.org/10.1016/j.ic.2019.01.001openalex-snapshot
On-line weighted pattern matching
inferred← citeshttps://doi.org/10.1137/1.9781611975482.68openalex-snapshot
The streaming k-mismatch problem
inferred← citeshttps://doi.org/10.3390/a14040116openalex-snapshot
Compressed Communication Complexity of Hamming Distance
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2023.12openalex-snapshot
Substring Complexity in Sublinear Space
inferred← citeshttps://doi.org/10.48550/arxiv.1708.04381openalex-snapshot
Streaming Periodicity with Mismatches
showing the first 9 of 10 · page through all 10
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.