On the public citation graph
On Covering Problems of Codes
0 signed · 230 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.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/tit.1978.1055873openalex-snapshot
On the inherent intractability of certain coding problems (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1981.1056379openalex-snapshot
Weight distribution of translates, covering radius, and perfect codes correcting errors of given weights
inferredcites →https://doi.org/10.1109/tit.1984.1056978openalex-snapshot
The complexity of computing the covering radius of a code
inferredcites →https://doi.org/10.1109/tit.1985.1057043openalex-snapshot
Covering radius---Survey and recent results
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.ch2openalex-snapshot
Efficient Restricted‐Case Algorithms for Problems in Computational Biology
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_13openalex-snapshot
Computational Molecular Biology
inferred← citeshttps://doi.org/10.1007/11499107_20openalex-snapshot
Constraint Metrics for Local Search
inferred← citeshttps://doi.org/10.1007/11527503_70openalex-snapshot
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
inferred← citeshttps://doi.org/10.1007/11851561_32openalex-snapshot
A Linear-Time Algorithm for Studying Genetic Variation
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_10openalex-snapshot
A Polynomial Time Approximation Scheme for the Closest Substring Problem
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_11openalex-snapshot
Approximation Algorithms for Hamming Clustering Problems
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_63openalex-snapshot
A PTAS for Distinguishing (Sub)string Selection
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_38openalex-snapshot
Exact Solutions for Closest String and Related Problems
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_21openalex-snapshot
On the Parameterized Intractability of Closest Substring and Related Problems
inferred← citeshttps://doi.org/10.1007/3-540-63220-4_63openalex-snapshot
Banishing bias from consensus sequences
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_73openalex-snapshot
Closest String and Substring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-9053-1_4openalex-snapshot
String Selection Problems
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_73openalex-snapshot
Closest String and Substring 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-030-51117-3_8openalex-snapshot
Locating-Domination and Identification
inferred← citeshttps://doi.org/10.1007/978-3-031-15714-1_28openalex-snapshot
Fairness in Temporal Slot Assignment
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_26openalex-snapshot
The k-Centre Problem for Classes of Cyclic Words
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_58openalex-snapshot
Selected String Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_12openalex-snapshot
String Consensus Problems with Swaps and Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-319-03524-6_43openalex-snapshot
An Efficient Algorithm for Rank Distance Consensus
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-319-07566-2_1openalex-snapshot
On the Efficiency of the Hamming C-Centerstring Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_11openalex-snapshot
Randomized and Parameterized Algorithms for the Closest String Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_15openalex-snapshot
Parameterized Complexity Analysis for the Closest String with Wildcards Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_13openalex-snapshot
On the Kernelization Complexity of String Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-10046-3_7openalex-snapshot
On the Far from Most String Problem, One of the Hardest String Selection Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-11918-2_24openalex-snapshot
On the String Consensus Problem and the Manhattan Sequence Consensus Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_41openalex-snapshot
Parameterized Enumeration for Modification Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-26626-8_57openalex-snapshot
Listing Center Strings Under the Edit Distance Metric
inferred← citeshttps://doi.org/10.1007/978-3-319-46759-7_11openalex-snapshot
Bit-Vector Search Filtering with Application to a Kanji Dictionary
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_14openalex-snapshot
Consensus String Problem for Multiple Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-59605-1_8openalex-snapshot
Designing and Implementing Algorithms for the Closest String Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_32openalex-snapshot
Closest Substring Problems for Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30219-3_31openalex-snapshot
Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity
inferred← citeshttps://doi.org/10.1007/978-3-540-30499-9_30openalex-snapshot
Closest Substring Problem – Results from an Evolutionary Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_19openalex-snapshot
On Exact and Approximation Algorithms for Distinguishing Substring Selection
inferred← citeshttps://doi.org/10.1007/978-3-540-78839-3_28openalex-snapshot
Computation of Median Gene Clusters
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-540-79228-4_21openalex-snapshot
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-89097-3_26openalex-snapshot
On the Structure of Small Motif Recognition Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-00727-9_15openalex-snapshot
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_26openalex-snapshot
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_27openalex-snapshot
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_23openalex-snapshot
Consensus Optimizing Both Distance Sum and Radius
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_24openalex-snapshot
Faster Algorithms for Sampling and Counting Biological Sequences
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-13509-5_28openalex-snapshot
Finding Optimal Alignment and Consensus of Circular Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_48openalex-snapshot
A Three-String Approach to 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-16321-0_10openalex-snapshot
Why Large Closest String Instances Are Easy to Solve in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_12openalex-snapshot
On the Hardness of Counting and Sampling Center Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_17openalex-snapshot
The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_73-2openalex-snapshot
Closest String and Substring Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-29124-1_20openalex-snapshot
Recurrent Genetic Algorithms: Sustaining Evolvability
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/978-3-642-31265-6_34openalex-snapshot
On Approximating String Selection Problems with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_24openalex-snapshot
Enumerating Neighbour and Closest Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_6openalex-snapshot
Configurations and Minority in the String Consensus Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-34859-4_19openalex-snapshot
An Efficient Two-Phase Ant Colony Optimization Algorithm for the Closest String Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-38516-2_14openalex-snapshot
Hybrid Metaheuristics for the Far From Most String Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_3openalex-snapshot
On Maximum Rank Aggregation Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_45openalex-snapshot
Finding Consensus Strings with Small Length Difference Between Input and Solution Strings
inferred← citeshttps://doi.org/10.1007/bf02944785openalex-snapshot
Integer programming models for computational biology problems
inferred← citeshttps://doi.org/10.1007/s00037-005-0193-yopenalex-snapshot
The complexity of the covering radius problem
inferred← citeshttps://doi.org/10.1007/s00224-004-1185-zopenalex-snapshot
Parameterized Intractability of Distinguishing Substring Selection
inferred← citeshttps://doi.org/10.1007/s00224-026-10265-yopenalex-snapshot
On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes
inferred← citeshttps://doi.org/10.1007/s00236-002-0093-4openalex-snapshot
On the complexity of the identification problem in Hamming spaces
inferred← citeshttps://doi.org/10.1007/s00453-003-1028-3openalex-snapshot
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems
inferred← citeshttps://doi.org/10.1007/s00453-014-9952-yopenalex-snapshot
Randomized Fixed-Parameter Algorithms for the Closest String Problem
inferred← citeshttps://doi.org/10.1007/s00453-015-9996-7openalex-snapshot
Configurations and Minority in the String Consensus Problem
inferred← citeshttps://doi.org/10.1007/s00453-019-00647-9openalex-snapshot
Consensus Strings with Small Maximum Distance and Small Distance Sum
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.1007/s00453-021-00842-7openalex-snapshot
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
inferred← citeshttps://doi.org/10.1007/s00493-006-0011-4openalex-snapshot
On The Parameterized Intractability Of Motif Search Problems*
inferred← citeshttps://doi.org/10.1007/s00521-013-1468-xopenalex-snapshot
Clustering based on median and closest string via rank distance with applications on DNA
inferred← citeshttps://doi.org/10.1007/s10107-019-01402-2openalex-snapshot
Combinatorial n-fold integer programming and applications
inferred← citeshttps://doi.org/10.1007/s10479-011-1028-7openalex-snapshot
Efficient solutions for the far from most string problem
inferred← citeshttps://doi.org/10.1007/s11128-021-03064-6openalex-snapshot
Using small-scale quantum devices to solve algebraic equations
inferred← citeshttps://doi.org/10.1016/j.apm.2011.02.010openalex-snapshot
An optimization modelling for string selection in molecular biology using Pareto optimality
inferred← citeshttps://doi.org/10.1016/j.apm.2011.05.015openalex-snapshot
Improved optimization modelling for the closest string and related problems
inferred← citeshttps://doi.org/10.1016/j.cor.2011.02.025openalex-snapshot
A GRASP algorithm for the Closest String Problem using a probability-based heuristic
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.2018.05.014openalex-snapshot
Mathematical programming formulations for the efficient solution of the k -sum approval voting problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100835openalex-snapshot
Computational Social Choice: Parameterized complexity and challenges
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100631openalex-snapshot
Submodular reassignment problem for reallocating agents to tasks with synergy effects
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104615openalex-snapshot
Consensus string problem for multiple regular languages
inferred← citeshttps://doi.org/10.1016/j.ins.2014.02.023openalex-snapshot
A set covering based approach to find the reduct of variable precision rough set
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.02.016openalex-snapshot
On the hardness of the Consensus String problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.10.006openalex-snapshot
Two-string consensus problem under non-overlapping inversion and transposition distance
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.01.003openalex-snapshot
A three-string approach to the closest string problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.10.001openalex-snapshot
The complexity of binary matrix completion under diameter constraints
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.12.001openalex-snapshot
On the parameterized complexity of clustering problems for incomplete data
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103796openalex-snapshot
Parameterized complexity of submodular minimization under uncertainty
inferred← citeshttps://doi.org/10.1016/j.jda.2014.10.002openalex-snapshot
On the hardness of maximum rank aggregation problems
inferred← citeshttps://doi.org/10.1016/j.mbs.2006.11.012openalex-snapshot
On some optimization problems in molecular biology
inferred← citeshttps://doi.org/10.1016/j.procs.2011.04.113openalex-snapshot
Exact Closest String as a Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.029openalex-snapshot
Multiple genome rearrangement by swaps and by element duplications
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.034openalex-snapshot
Efficient algorithms for consensus string problems minimizing both distance sum and radius
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.018openalex-snapshot
Finding consensus and optimal alignment of circular strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.037openalex-snapshot
On approximating string selection problems with outliers
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.043openalex-snapshot
Parameterized complexity analysis for the Closest String with Wildcards problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.022openalex-snapshot
On the string consensus problem and the Manhattan sequence consensus problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.024openalex-snapshot
On the kernelization complexity of string problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.017openalex-snapshot
Designing and implementing algorithms for the closest string problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.002openalex-snapshot
Parameterized resiliency problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.005openalex-snapshot
Closest substring problems for regular languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115963openalex-snapshot
On the complexity of finding central configurations of the graph-generalized (n2−1)-puzzle
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00211-1openalex-snapshot
The approximate period problem for DNA alphabet
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00320-7openalex-snapshot
On the complexity of finding common approximate substrings
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00057-9openalex-snapshot
Distinguishing string selection problems
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00011-xopenalex-snapshot
The consensus string problem for a metric is NP-complete
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00079-0openalex-snapshot
Approximation algorithms for Hamming clustering problems
inferred← citeshttps://doi.org/10.1023/a:1019545003953openalex-snapshot
Center and Distinguisher for Strings with Unbounded Alphabet
inferred← citeshttps://doi.org/10.1051/wujns/2021266453openalex-snapshot
The Walsh Transform of a Class of Boolean Functions
inferred← citeshttps://doi.org/10.1080/00207160.2010.493582openalex-snapshot
On some multiobjective optimization problems arising in biology
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.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.002.0004openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0001openalex-snapshot
INTRODUCTION TO FIXED-PARAMETER ALGORITHMS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0002openalex-snapshot
PRELIMINARIES AND AGREEMENTS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0003openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY—A PRIMER
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0004openalex-snapshot
VERTEX COVER—AN ILLUSTRATIVE EXAMPLE
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0005openalex-snapshot
THE ART OF PROBLEM PARAMETERIZATION
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0006openalex-snapshot
SUMMARY AND CONCLUDING REMARKS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0007openalex-snapshot
DATA REDUCTION AND PROBLEM KERNELS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0008openalex-snapshot
DEPTH-BOUNDED SEARCH TREES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0009openalex-snapshot
DYNAMIC PROGRAMMING
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0010openalex-snapshot
TREE DECOMPOSITIONS OF GRAPHS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0011openalex-snapshot
FURTHER ADVANCED TECHNIQUES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0012openalex-snapshot
SUMMARY AND CONCLUDING REMARKS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0014openalex-snapshot
CONNECTIONS TO APPROXIMATION ALGORITHMS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0015openalex-snapshot
SELECTED CASE STUDIES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0016openalex-snapshot
ZUKUNFTSMUSIK
inferred← citeshttps://doi.org/10.1101/709949openalex-snapshot
A massively parallel algorithm for finding non-existing sequences in genomes
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313831openalex-snapshot
The complexity of the covering radius problem on lattices and codes
inferred← citeshttps://doi.org/10.1109/csb.2003.1227407openalex-snapshot
Genetic algorithm approach for the closest string problem
inferred← citeshttps://doi.org/10.1109/csbw.2005.113openalex-snapshot
PROMOCO: a New Program for Prediction of cis Regulatory Elements: From High-Information Content Analysis to Clique Identification
inferred← citeshttps://doi.org/10.1109/icbbe.2008.171openalex-snapshot
A Compounded Genetic and Simulated Annealing Algorithm for the Closest String Problem
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498355openalex-snapshot
On the complexity of reverse similarity search
inferred← citeshttps://doi.org/10.1109/icpr.2016.7899854openalex-snapshot
Distance-preserving vector space embedding for the closest string problem
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/iraniancee.2010.5507004openalex-snapshot
A Memetic Algorithm for closest string problem and farthest string problem
inferred← citeshttps://doi.org/10.1109/isit.2013.6620457openalex-snapshot
On Chebyshev radius of a set in Hamming space and the closest string problem
inferred← citeshttps://doi.org/10.1109/memb.2005.1436464openalex-snapshot
Optimization techniques for string selection and comparison problems in genomics
inferred← citeshttps://doi.org/10.1109/sfcs.2005.70openalex-snapshot
The Closest Substring problem with small distances
inferred← citeshttps://doi.org/10.1109/sisap.2008.16openalex-snapshot
On the Complexity of Reverse Similarity Search
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/synasc.2012.14openalex-snapshot
Clustering Methods Based on Closest String via Rank Distance
inferred← citeshttps://doi.org/10.1109/tcbb.2010.107openalex-snapshot
Multiple Sequence Assembly from Reads Alignable to a Common Reference Genome
inferred← citeshttps://doi.org/10.1109/tcbb.2011.134openalex-snapshot
Mutation Region Detection for Closely Related Individuals without a Known Pedigree
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.1109/tcbb.2012.84openalex-snapshot
On the Hardness of Counting and Sampling Center Strings
inferred← citeshttps://doi.org/10.1109/tcbb.2014.2306842openalex-snapshot
Improved Exact Enumerative Algorithms for the Planted ( $l$ , $d$ )-Motif Search Problem
inferred← citeshttps://doi.org/10.1109/tit.2002.800490openalex-snapshot
Identifying and locating-dominating codes: NP-completeness results for directed graphs
inferred← citeshttps://doi.org/10.1109/tit.2004.831850openalex-snapshot
On the Complexity of Multicovering Radii
inferred← citeshttps://doi.org/10.1109/tit.2017.2691763openalex-snapshot
Characterization of Metrics Induced by Hierarchical Posets
inferred← citeshttps://doi.org/10.1109/tkde.2007.1001openalex-snapshot
An Exact Data Mining Method for Finding Center Strings and All Their Instances
inferred← citeshttps://doi.org/10.1109/tsmc.2019.2896657openalex-snapshot
Distance-Preserving Vector Space Embedding for Consensus Learning
inferred← citeshttps://doi.org/10.1109/wicom.2011.6040160openalex-snapshot
Research on Secure Multi-Party Closest String Problem
inferred← citeshttps://doi.org/10.1111/itor.12167openalex-snapshot
Hybridizations of GRASP with path relinking for the far from most string problem
inferred← citeshttps://doi.org/10.1137/060673898openalex-snapshot
Closest Substring Problems with Small Distances
inferred← citeshttps://doi.org/10.1137/080720401openalex-snapshot
Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences
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.1137/19m1255781openalex-snapshot
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series
inferred← citeshttps://doi.org/10.1142/9789812709394_0053openalex-snapshot
MOTIF DISCOVERY FIXING MISMATCH POSITIONS
inferred← citeshttps://doi.org/10.1142/s021972000700293xopenalex-snapshot
PREDICTION OF cis-REGULATORY ELEMENTS: FROM HIGH-INFORMATION CONTENT ANALYSIS TO MOTIF IDENTIFICATION
inferred← citeshttps://doi.org/10.1145/1329125.1329365openalex-snapshot
Some results on approximating the minimax solution in approval voting
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/1921659.1921672openalex-snapshot
Discovering almost any hidden motif from multiple sequences
inferred← citeshttps://doi.org/10.1145/2330163.2330221openalex-snapshot
PSO based on surrogate modeling as meta-search to optimise evolutionary algorithms parameters
inferred← citeshttps://doi.org/10.1145/301250.301376openalex-snapshot
Finding similar regions in many strings
inferred← citeshttps://doi.org/10.1145/3110290openalex-snapshot
Finding Consensus Strings with Small Length Difference between Input and Solution Strings
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.1145/506147.506150openalex-snapshot
On the closest string and substring problems
inferred← citeshttps://doi.org/10.11648/j.cbb.20160402.11openalex-snapshot
A New Idea for Improving the Running Time of PMS Algorithm
inferred← citeshttps://doi.org/10.1186/1471-2105-11-s1-s11openalex-snapshot
Fast motif recognition via application of statistical thresholds
inferred← citeshttps://doi.org/10.1186/1471-2105-12-106openalex-snapshot
Swiftly Computing Center Strings
inferred← citeshttps://doi.org/10.1186/1471-2105-12-s1-s55openalex-snapshot
Closest string with outliers
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0090openalex-snapshot
Optimal Solutions for the Closest-String Problem via Integer Programming
inferred← citeshttps://doi.org/10.1371/journal.pone.0037576openalex-snapshot
An Efficient Rank Based Approach for Closest String and Closest Substring
inferred← citeshttps://doi.org/10.14722/ndss.2024.241401openalex-snapshot
Experimental Analyses of the Physical Surveillance Risks in Client-Side Content Scanning
inferred← citeshttps://doi.org/10.1504/ijbra.2008.018341openalex-snapshot
An effective algorithm of motif finding problem
inferred← citeshttps://doi.org/10.1504/ijcbdd.2011.041413openalex-snapshot
A hybrid metaheuristic for Closest String Problem
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8608openalex-snapshot
Computational Aspects of Nearly Single-Peaked Electorates
inferred← citeshttps://doi.org/10.1609/aaai.v35i8.16896openalex-snapshot
The Parameterized Complexity of Clustering Incomplete Data
inferred← citeshttps://doi.org/10.1613/jair.1.12388openalex-snapshot
Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation
showing the first 200 of 225 · page through all 225
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.