On the public citation graph

Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem

0 signed · 33 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/bf02679443openalex-snapshot
On Covering Problems of Codes
inferredcites →https://doi.org/10.1016/s0890-5401(03)00057-9openalex-snapshot
Distinguishing string selection problems
inferredcites →https://doi.org/10.1063/1.1699114openalex-snapshot
Equation of State Calculations by Fast Computing Machines
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1145/301250.301376openalex-snapshot
Finding similar regions in many strings

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119136798.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-1-4614-9053-1_4openalex-snapshot
String Selection Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_10openalex-snapshot
Algorithms for Closest and Farthest String Problems via Rank Distance
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_58openalex-snapshot
Selected String Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07124-4_58openalex-snapshot
Selected String Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_58-1openalex-snapshot
Selected String Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_58-2openalex-snapshot
Selected String Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78839-3_33openalex-snapshot
More Efficient Algorithms for Closest String and Substring Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_31openalex-snapshot
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-14883-5_70openalex-snapshot
A Meta Heuristic Solution for Closest String Problem Using Ant Colony System
inferred← citeshttps://doi.org/10.1007/978-3-642-15294-8_27openalex-snapshot
Swiftly Computing Center Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_33openalex-snapshot
On the Closest String via Rank Distance
inferred← citeshttps://doi.org/10.1007/s00453-021-00809-8openalex-snapshot
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2008.09.008openalex-snapshot
A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks
inferred← citeshttps://doi.org/10.1016/j.cor.2011.06.005openalex-snapshot
A heuristic algorithm based on Lagrangian relaxation for the closest string problem
inferred← citeshttps://doi.org/10.1016/j.cor.2013.07.017openalex-snapshot
The Selective Fixing Algorithm for the closest string problem
inferred← citeshttps://doi.org/10.1080/10556788.2013.833616openalex-snapshot
A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem
inferred← citeshttps://doi.org/10.1109/access.2022.3218003openalex-snapshot
A Heuristic Solution to the Closest String Problem Using Wave Function Collapse Techniques
inferred← citeshttps://doi.org/10.1109/icnc.2007.386openalex-snapshot
Forecast the Dangerous Level of Gas Outburst Based on GASA Neural Networks in Coal Mine
inferred← citeshttps://doi.org/10.1109/icsmc.2010.5641888openalex-snapshot
A heuristic algorithm based on Lagrangian relaxation for the closest string problem
inferred← citeshttps://doi.org/10.1109/synasc.2011.31openalex-snapshot
A Genetic Approximation of Closest String via Rank Distance
inferred← citeshttps://doi.org/10.1109/tcbb.2011.21openalex-snapshot
Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L,d)-Motif Model
inferred← citeshttps://doi.org/10.1137/080739069openalex-snapshot
More Efficient Algorithms for Closest String and Substring Problems
inferred← citeshttps://doi.org/10.1137/1.9781611972917.2openalex-snapshot
A Closer Look at the Closest String and Closest Substring Problem
inferred← citeshttps://doi.org/10.1145/1570256.1570275openalex-snapshot
A data-based coding of candidate strings in the closest string problem
inferred← citeshttps://doi.org/10.1145/3205455.3205598openalex-snapshot
Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem
inferred← citeshttps://doi.org/10.1186/1471-2105-12-106openalex-snapshot
Swiftly Computing Center Strings
inferred← citeshttps://doi.org/10.1371/journal.pone.0037576openalex-snapshot
An Efficient Rank Based Approach for Closest String and Closest Substring
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.