scholarly journals A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length

2017 ◽  
Vol 674 ◽  
pp. 116-118 ◽  
Author(s):  
Yaroslav Shitov
Keyword(s):  
Completeness Proof ◽  
Np Completeness ◽  
Fixed Length

scholarly journals Physical Zero-Knowledge Proof and NP-completeness Proof of Suguru Puzzle

2021 ◽  
pp. 104858
Author(s):  
Léo Robert ◽  
Daiki Miyahara ◽  
Pascal Lafourcade ◽  
Luc Libralesso ◽  
Takaaki Mizuki
Keyword(s):  
Zero Knowledge ◽  
Completeness Proof ◽  
Np Completeness ◽  
Zero Knowledge Proof

A 2-approximation algorithm for the contig-based genomic scaffold filling problem

2018 ◽  
Vol 16 (06) ◽  
pp. 1850022 ◽  
Author(s):  
Haitao Jiang ◽  
Letu Qingge ◽  
Daming Zhu ◽  
Binhai Zhu
Keyword(s):  
Approximation Algorithm ◽  
Reference Genome ◽  
Constant Factor ◽  
Important Case ◽  
Completeness Proof ◽  
Np Completeness ◽  
Genomic Scaffold ◽  
Np Complete ◽  
Filling Problem ◽  
Input Formula

The genomic scaffold filling problem has attracted a lot of attention recently. The problem is on filling an incomplete sequence (scaffold) [Formula: see text] into [Formula: see text], with respect to a complete reference genome [Formula: see text], such that the number of common/shared adjacencies between [Formula: see text] and [Formula: see text] is maximized. The problem is NP-complete, and admits a constant-factor approximation. However, the sequence input [Formula: see text] is not quite practical and does not fit most of the real datasets (where a scaffold is more often given as a list of contigs). In this paper, we revisit the genomic scaffold filling problem by considering this important case when a scaffold [Formula: see text] is given, the missing genes can only be inserted in between the contigs, and the objective is to maximize the number of common adjacencies between [Formula: see text] and the filled genome [Formula: see text]. For this problem, we present a simple NP-completeness proof, we then present a factor-2 approximation algorithm.

A Fixed Field/Fixed Length Automated Case Record Using an IBM 1232 Optically Readable Document

1968 ◽  
Vol 07 (03) ◽  
pp. 156-158
Author(s):  
Th. R. Taylor
Keyword(s):  
Clinical Data ◽  
Case Record ◽  
Fixed Field ◽  
Fixed Length

The technique, scope and limitations of a fixed field/fixed length case record utilising the IBM 1232 system is described. The principal problems lie with personnel rather than machinery and with programmes for analysis rather than clinical data.

scholarly journals NP-completeness and degree restricted spanning trees

1992 ◽  
Vol 105 (1-3) ◽  
pp. 41-47 ◽  
Author(s):  
Robert James Douglas
Keyword(s):  
Spanning Trees ◽  
Np Completeness
Sign in / Sign up

Export Citation Format

Share Document