On the public citation graph

A linear space algorithm for the LCS problem

https://doi.org/10.1007/bf00265993
0 signed · 44 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.1007/bf00264437openalex-snapshot
A longest common subsequence algorithm suitable for similar text strings
inferredcites →https://doi.org/10.1016/0020-0255(80)90025-0openalex-snapshot
A fast algorithm for the longest-common-subsequence problem
inferredcites →https://doi.org/10.1016/0022-0000(80)90002-1openalex-snapshot
A faster algorithm computing string edit distances
inferredcites →https://doi.org/10.1016/0022-0000(84)90025-4openalex-snapshot
New algorithms for the LCS problem
inferredcites →https://doi.org/10.1038/scientificamerican0769-86openalex-snapshot
Computer Analysis of Protein Evolution
inferredcites →https://doi.org/10.1109/tsmc.1978.4309979openalex-snapshot
A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/321921.321922openalex-snapshot
Bounds on the Complexity of the Longest Common Subsequence Problem
inferredcites →https://doi.org/10.1145/322033.322044openalex-snapshot
Algorithms for the Longest Common Subsequence Problem
inferredcites →https://doi.org/10.1145/322063.322075openalex-snapshot
The Complexity of Some Problems on Subsequences and Supersequences
inferredcites →https://doi.org/10.1145/359581.359603openalex-snapshot
A fast algorithm for computing longest common subsequences
inferredcites →https://doi.org/10.1145/360825.360861openalex-snapshot
A linear space algorithm for computing maximal common subsequences

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.1993.1008openalex-snapshot
Generalized Sequence Alignment and Duality
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_63openalex-snapshot
Longest common subsequences
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_53openalex-snapshot
A new flexible algorithm for the longest common subsequence problem
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_8openalex-snapshot
String Editing and Longest Common Subsequences
inferred← citeshttps://doi.org/10.1007/bf01075212openalex-snapshot
Complexity of common subsequence and supersequence problems and related problems
inferred← citeshttps://doi.org/10.1007/s41468-023-00156-3openalex-snapshot
Move schedules: fast persistence computations in coarse dynamic settings
inferred← citeshttps://doi.org/10.1016/0167-6393(92)90024-2openalex-snapshot
Learning language models through the ECGI method
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90170-7openalex-snapshot
An algorithm for distinguishing efficiently bit-strings by their subsequences
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90132-yopenalex-snapshot
Fast linear-space computations of longest common subsequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.027openalex-snapshot
Efficient merged longest common subsequence algorithms for similar sequences
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00114-9openalex-snapshot
Simple and fast linear space computation of longest common subsequences
inferred← citeshttps://doi.org/10.1016/s0167-9260(98)00003-0openalex-snapshot
Systolic-based parallel architecture for the longest common subsequences problem
inferred← citeshttps://doi.org/10.1023/a:1008087824437openalex-snapshot
An Efficient Systolic Algorithm for the Longest Common Subsequence Problem
inferred← citeshttps://doi.org/10.1080/01495739808947359openalex-snapshot
APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
inferred← citeshttps://doi.org/10.1080/02533839.2000.9670581openalex-snapshot
Another efficient systolic algorithm for the longest common subsequence problem
inferred← citeshttps://doi.org/10.1080/10637190208941431openalex-snapshot
DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
inferred← citeshttps://doi.org/10.1093/bioinformatics/13.1.75openalex-snapshot
A tool for aligning very similar DNA sequences
inferred← citeshttps://doi.org/10.1109/iccic.2012.6510271openalex-snapshot
Positional_LCS: A position based algorithm to find Longest Common Subsequence (LCS) in Sequence Database (SDB)
inferred← citeshttps://doi.org/10.1109/icme.2000.869533openalex-snapshot
Multimedia linguistic learning
inferred← citeshttps://doi.org/10.1109/icmlc.2008.4620949openalex-snapshot
An efficient and hardware-implementable systolic algorithm for the longest common subsequence problem
inferred← citeshttps://doi.org/10.1109/informatics47936.2019.9119320openalex-snapshot
Some innovations of teaching the course on Data structures and algorithms
inferred← citeshttps://doi.org/10.1109/intech.2012.6457783openalex-snapshot
Data-driven name reduction for record linkage
inferred← citeshttps://doi.org/10.1109/spire.1998.712980openalex-snapshot
New approximation algorithms for longest common subsequences
inferred← citeshttps://doi.org/10.1109/spire.2000.878178openalex-snapshot
A survey of longest common subsequence algorithms
inferred← citeshttps://doi.org/10.1109/tcbb.2008.94openalex-snapshot
Cache-Oblivious Dynamic Programming for Bioinformatics
inferred← citeshttps://doi.org/10.1201/9781420049503-c14openalex-snapshot
General Pattern Matching
inferred← citeshttps://doi.org/10.1201/9781584888239-c15openalex-snapshot
General Pattern Matching
inferred← citeshttps://doi.org/10.25669/hfa8-0cqvopenalex-snapshot
Measuring the accuracy of page-reading systems
inferred← citeshttps://doi.org/10.48550/arxiv.0903.3579openalex-snapshot
String comparison by transposition networks
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0301030openalex-snapshot
Bounds on the Number of Longest Common Subsequences
inferred← citeshttps://doi.org/10.5555/1109557.1109622openalex-snapshot
Cache-oblivious dynamic programming
inferred← citeshttps://doi.org/10.7124/bc.000299openalex-snapshot
Filtration efficiency in rapid homology search statistical 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.