Mapping the genome
From MaRDI portal
Publication:5248496
DOI10.1145/167088.167170zbMath1310.92022OpenAlexW2093843227MaRDI QIDQ5248496
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167170
Combinatorics in computer science (68R05) Biochemistry, molecular biology (92C40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Genetics and epigenetics (92D10)
Related Items (35)
Talent hold cost minimization in film production ⋮ An \(O(n\log n)\) algorithm for finding dissimilar strings ⋮ DNA sequencing and string learning ⋮ Edit Distance for Pushdown Automata ⋮ Linear-time minimal cograph editing ⋮ How hard is to compute the edit distance ⋮ The \(S\)-\textsc{labeling} problem: an algorithmic tour ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ The consensus string problem for a metric is NP-complete ⋮ Approximation algorithms for tree alignment with a given phylogeny ⋮ An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem ⋮ Satisfiability problems on intervals and unit intervals ⋮ Interval graphs with side (and size) constraints ⋮ Non-approximability of weighted multiple sequence alignment. ⋮ Interval graph limits ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ Molecular solution to the optimal linear arrangement problem based on DNA computation ⋮ Minimal obstructions for partial representations of interval graphs ⋮ Minimal cutwidth linear arrangements of abelian Cayley graphs ⋮ An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method ⋮ Fixed-parameter complexity of minimum profile problems ⋮ Algorithmic expedients for the \(S\)-labeling problem ⋮ String factorisations with maximum or minimum dimension ⋮ The complexity of multiple sequence alignment with SP-score that is a metric ⋮ On the interval completion of chordal graphs ⋮ On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ Faster and enhanced inclusion-minimal cograph completion ⋮ A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs ⋮ Node set optimization problem for complete Josephus cubes ⋮ On intervalizing \(k\)-colored graphs for DNA physical mapping ⋮ Layout of random circulant graphs ⋮ Genotyping of pooled microsatellite markers by combinatorial optimization techniques ⋮ How hard is computing the edit distance? ⋮ The complexity of string partitioning
This page was built for publication: Mapping the genome
