On the public citation graph
Improved heuristics and a genetic algorithm for finding short supersequences
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.
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/978-3-642-80117-4openalex-snapshot
Operations Research Proceedings 1995
inferredcites →https://doi.org/10.1007/978-3-642-80117-4_64openalex-snapshot
Parallel Genetic Algorithm for the Capacitated Lot-Sizing Problem
inferredcites →https://doi.org/10.1007/bf01075212openalex-snapshot
Complexity of common subsequence and supersequence problems and related problems
inferredcites →https://doi.org/10.1016/0004-3702(92)90016-qopenalex-snapshot
Theory and algorithms for plan merging
inferredcites →https://doi.org/10.1016/0304-3975(81)90075-xopenalex-snapshot
The shortest common supersequence problem over binary alphabet is NP-complete
inferredcites →https://doi.org/10.1016/0304-3975(92)00074-2openalex-snapshot
More on the complexity of common superstring and supersequence problems
inferredcites →https://doi.org/10.1137/s009753979223842xopenalex-snapshot
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
inferredcites →https://doi.org/10.1145/322063.322075openalex-snapshot
The Complexity of Some Problems on Subsequences and Supersequences
inferredcites →https://doi.org/10.5555/642129.642130openalex-snapshot
Approximation algorithms for the shortest common supersequence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470411353.ch16openalex-snapshot
Metaheuristics in Bioinformatics: DNA Sequencing and Reconstruction
inferred← citeshttps://doi.org/10.1007/1-4020-5123-9_10openalex-snapshot
COMPUTER-AIDED OPTIMIZATION OF DNA ARRAY DESIGN AND MANUFACTURING
inferred← citeshttps://doi.org/10.1007/11494669_7openalex-snapshot
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
inferred← citeshttps://doi.org/10.1007/11499305_9openalex-snapshot
Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-71615-0_4openalex-snapshot
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74549-5_51openalex-snapshot
Fingerprint Matching with an Evolutionary Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-78295-7_4openalex-snapshot
Hybridizations of Metaheuristics With Branch & Bound Derivates
inferred← citeshttps://doi.org/10.1007/978-3-642-32615-8_40openalex-snapshot
An Ant-Colony Algorithm to Transform Jobshops into Flowshops: A Case of Shortest-Common-Supersequence Stringology Problem
inferred← citeshttps://doi.org/10.1007/978-981-16-2774-3_6openalex-snapshot
A Deterministic Heuristic Algorithm to Minimize the Length of a Manufacturing Line in Transformation of Jobshops into Flowshops
inferred← citeshttps://doi.org/10.1007/bfb0056911openalex-snapshot
An island model based ant system with lookahead for the shortest supersequence problem
inferred← citeshttps://doi.org/10.1007/s00500-008-0386-9openalex-snapshot
A niching genetic k-means algorithm and its applications to gene expression data
inferred← citeshttps://doi.org/10.1016/j.biosystems.2004.05.013openalex-snapshot
Coevolving solutions to the shortest common superstring problem
inferred← citeshttps://doi.org/10.1016/j.cie.2006.10.001openalex-snapshot
An adaptive branch and bound approach for transforming job shops into flow shops
inferred← citeshttps://doi.org/10.1016/j.compbiolchem.2016.05.004openalex-snapshot
Chemical reaction optimization for solving shortest common supersequence problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2011.08.006openalex-snapshot
An enhanced beam search algorithm for the Shortest Common Supersequence Problem
inferred← citeshttps://doi.org/10.1016/j.jocs.2022.101562openalex-snapshot
Surrogate-assisted performance prediction for data-driven knowledge discovery algorithms: Application to evolutionary modeling of clinical pathways
inferred← citeshttps://doi.org/10.1016/j.jss.2008.09.033openalex-snapshot
A new relevance feedback technique for iconic image retrieval based on spatial relationships
inferred← citeshttps://doi.org/10.1016/j.procs.2016.07.322openalex-snapshot
Route Optimisation byAnt Colony OptimisationTechnique
inferred← citeshttps://doi.org/10.1080/07408170008963907openalex-snapshot
Minimal investment budgets for flow line configuration
inferred← citeshttps://doi.org/10.1080/07408170590918191openalex-snapshot
Efficient heuristic approaches to transform job shops into flow shops
inferred← citeshttps://doi.org/10.1093/bioinformatics/btg1073openalex-snapshot
The shortest common supersequence problem in a microarray production setting
inferred← citeshttps://doi.org/10.1109/iccd.2003.1240883openalex-snapshot
Design flow enhancements for DNA arrays
inferred← citeshttps://doi.org/10.1109/iciev.2016.7760187openalex-snapshot
Solving shortest common supersequence problem using chemical reaction optimization
inferred← citeshttps://doi.org/10.1109/imsccs.2006.136openalex-snapshot
Towards a Better Solution to the Shortest Common Supersequence Problem: A Post
inferred← citeshttps://doi.org/10.1109/tcad.2005.855940openalex-snapshot
Computer-Aided Optimization of DNA Array Design and Manufacturing
inferred← citeshttps://doi.org/10.1109/tcad.2012.2235127openalex-snapshot
Selective Flexibility: Creating Domain-Specific Reconfigurable Arrays
inferred← citeshttps://doi.org/10.1109/tifs.2007.902681openalex-snapshot
A Memetic Fingerprint Matching Algorithm
inferred← citeshttps://doi.org/10.1109/tsmcb.2006.883266openalex-snapshot
On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques
inferred← citeshttps://doi.org/10.1145/1830483.1830529openalex-snapshot
Efficient stochastic local search algorithm for solving the shortest common supersequence problem
inferred← citeshttps://doi.org/10.1145/2001576.2001620openalex-snapshot
Evolutionary-based iterative local search algorithm for the shortest common supersequence problem
inferred← citeshttps://doi.org/10.1162/106454699568728openalex-snapshot
Ant Algorithms for Discrete Optimization
inferred← citeshttps://doi.org/10.1186/1471-2105-7-s4-s12openalex-snapshot
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
inferred← citeshttps://doi.org/10.1371/journal.pone.0052427openalex-snapshot
A Multilevel Probabilistic Beam Search Algorithm for the Shortest Common Supersequence Problem
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.