On the public citation graph
Approximate Matching in Weighted Sequences
0 signed · 28 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.1006/inco.1995.1047openalex-snapshot
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures
inferredcites →https://doi.org/10.1007/978-3-540-30213-1_41openalex-snapshot
Motif Extraction from Weighted Sequences
inferredcites →https://doi.org/10.1093/nar/22.22.4673openalex-snapshot
CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice
inferredcites →https://doi.org/10.1109/sfcs.1989.63475openalex-snapshot
Efficient tree pattern matching
inferredcites →https://doi.org/10.1126/science.1058040openalex-snapshot
The Sequence of the Human Genome
inferredcites →https://doi.org/10.1145/258533.258553openalex-snapshot
Tree pattern matching and subset matching in randomized O(nlog 3 m) time
inferredcites →https://doi.org/10.1145/509907.509992openalex-snapshot
Verifying candidate matches in sparse and wildcard matching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470892107.ch1openalex-snapshot
String Data Structures for Computational Molecular Biology
inferred← citeshttps://doi.org/10.1002/9780470892107.ch8openalex-snapshot
Recent Advances in Weighted DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-23660-5_7openalex-snapshot
Linear-Time Computation of Prefix Table for Weighted Strings
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_40openalex-snapshot
On-Line Pattern Matching on Uncertain Sequences and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_38openalex-snapshot
Polynomial-Time Approximation Algorithms for Weighted LCS Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_6openalex-snapshot
Weighted Shortest Common Supersequence
inferred← citeshttps://doi.org/10.1016/j.dam.2015.11.005openalex-snapshot
A multiobjective optimization algorithm for the weighted LCS
inferred← citeshttps://doi.org/10.1016/j.dam.2015.11.011openalex-snapshot
Polynomial-time approximation algorithms for weighted LCS problem
inferred← citeshttps://doi.org/10.1016/j.ic.2019.01.001openalex-snapshot
On-line weighted pattern matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.029openalex-snapshot
Linear-time computation of prefix table for weighted strings & applications
inferred← citeshttps://doi.org/10.1109/dcc.2017.14openalex-snapshot
Streaming K-Mismatch with Error Correcting and Applications
inferred← citeshttps://doi.org/10.1142/s0129054118430062openalex-snapshot
Fast Average-Case Pattern Matching on Weighted Sequences
inferred← citeshttps://doi.org/10.1145/3383972.3384007openalex-snapshot
Uncertain String Matching Based on Bitmap Indexing
inferred← citeshttps://doi.org/10.3934/medsci.2017.4.426openalex-snapshot
Space Efficient Data Structures for N-gram Retrieval
inferred← citeshttps://doi.org/10.5121/ijdps.2011.2103openalex-snapshot
A Dynamic Approach to Weighted Suffix Tree Construction Algorithm
inferred← citeshttps://doi.org/10.5220/0004788502310238openalex-snapshot
Handling Weighted Sequences Employing Inverted Files and Suffix Trees
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.