Finding similar regions in many strings
From MaRDI portal
Publication:2819580
DOI10.1145/301250.301376zbMath1346.68307OpenAlexW2085239230MaRDI QIDQ2819580
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301376
Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25) Algorithms on strings (68W32)
Related Items (21)
Hard problems in similarity searching ⋮ On the longest common rigid subsequence problem ⋮ RNA multiple structural alignment with longest common subsequences ⋮ On some optimization problems in molecular biology ⋮ The selective fixing algorithm for the closest string problem ⋮ An improved integer linear programming formulation for the closest 0-1 string problem ⋮ Efficient Algorithms for the Closest String and Distinguishing String Selection Problems ⋮ On the complexity of deriving position specific score matrices from positive and negative sequences ⋮ The consensus string problem for a metric is NP-complete ⋮ Approximation algorithms for Hamming clustering problems ⋮ An optimization modelling for string selection in molecular biology using Pareto optimality ⋮ On the complexity of finding common approximate substrings. ⋮ An upper bound on the hardness of exact matrix based motif discovery ⋮ On some multiobjective optimization problems arising in biology ⋮ Sublinear time motif discovery from multiple sequences ⋮ Efficient solutions for the far from most string problem ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ Finding compact structural motifs ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ Near optimal multiple alignment within a band in polynomial time ⋮ Hardness results for the center and median string problems under the weighted and unweighted edit distances
This page was built for publication: Finding similar regions in many strings
