Computing the Tandem Duplication Distance is NP-Hard

2022 ◽  
Vol 36 (1) ◽  
pp. 64-91
Author(s):  
Manuel Lafond ◽  
Binhai Zhu ◽  
Peng Zou
Keyword(s):  
Tandem Duplication ◽  
Np Hard

Learning Importance of Preferences

10.29007/v68w ◽  
2018 ◽  
Author(s):  
Ying Zhu ◽  
Mirek Truszczynski
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scoring Rules ◽  
Np Hard ◽  
Individual Preferences

We study the problem of learning the importance of preferences in preference profiles in two important cases: when individual preferences are aggregated by the ranked Pareto rule, and when they are aggregated by positional scoring rules. For the ranked Pareto rule, we provide a polynomial-time algorithm that finds a ranking of preferences such that the ranked profile correctly decides all the examples, whenever such a ranking exists. We also show that the problem to learn a ranking maximizing the number of correctly decided examples (also under the ranked Pareto rule) is NP-hard. We obtain similar results for the case of weighted profiles when positional scoring rules are used for aggregation.

TANDEM DUPLICATION RANDOM LOSS EVENTS INFLUENCED TO GENE ORDER CHANGES IN BAIKALIAN AMPHIPODS

2018 ◽  
Author(s):  
E.A. SIROTININA ◽  
◽  
E.V. ROMANOVA ◽  
D. YU. SHERBAKOV ◽  
◽  
...  
Keyword(s):  
Gene Order ◽  
Tandem Duplication ◽  
Random Loss

scholarly journals Optimizing Transmit Sequence and Instrumental Variables Receiver for Dual-Function Complexity System

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Yu Yao ◽  
Junhui Zhao ◽  
Lenan Wu
Keyword(s):  
Approximate Solution ◽  
Instrumental Variables ◽  
Performance Index ◽  
Dual Function ◽  
Np Hard ◽  
Match Filter ◽  
Filter Output ◽  
Phase Code ◽  
Discrete Phase ◽  
Simulation Results

This correspondence deals with the joint cognitive design of transmit coded sequences and instrumental variables (IV) receive filter to enhance the performance of a dual-function radar-communication (DFRC) system in the presence of clutter disturbance. The IV receiver can reject clutter more efficiently than the match filter. The signal-to-clutter-and-noise ratio (SCNR) of the IV filter output is viewed as the performance index of the complexity system. We focus on phase only sequences, sharing both a continuous and a discrete phase code and develop optimization algorithms to achieve reasonable pairs of transmit coded sequences and IV receiver that fine approximate the behavior of the optimum SCNR. All iterations involve the solution of NP-hard quadratic fractional problems. The relaxation plus randomization technique is used to find an approximate solution. The complexity, corresponding to the operation of the proposed algorithms, depends on the number of acceptable iterations along with on and the complexity involved in all iterations. Simulation results are offered to evaluate the performance generated by the proposed scheme.

scholarly journals BCOR Internal Tandem Duplication Expression in Neural Stem Cells Promotes Growth, Invasion, and Expression of PRC2 Targets

2021 ◽  
Vol 22 (8) ◽  
pp. 3913
Author(s):  
Satoshi Nakata ◽  
Ming Yuan ◽  
Jeffrey A. Rubens ◽  
Ulf D. Kahlert ◽  
Jarek Maciaczyk ◽  
...  
Keyword(s):  
Stem Cells ◽  
Neural Stem Cells ◽  
Tandem Duplication ◽  
Target Genes ◽  
Cellular Growth ◽  
Central Nervous System Tumor ◽  
Internal Tandem Duplication ◽  
Invasion And Migration ◽  
Human Neural Stem Cells ◽  
And Migration

Central nervous system tumor with BCL6-corepressor internal tandem duplication (CNS-BCOR ITD) is a malignant entity characterized by recurrent alterations in exon 15 encoding the essential binding domain for the polycomb repressive complex (PRC). In contrast to deletion or truncating mutations seen in other tumors, BCOR expression is upregulated in CNS-BCOR ITD, and a distinct oncogenic mechanism has been suggested. However, the effects of this change on the biology of neuroepithelial cells is poorly understood. In this study, we introduced either wildtype BCOR or BCOR-ITD into human and murine neural stem cells and analyzed them with quantitative RT-PCR and RNA-sequencing, as well as growth, clonogenicity, and invasion assays. In human cells, BCOR-ITD promoted derepression of PRC2-target genes compared to wildtype BCOR. A similar effect was found in clinical specimens from previous studies. However, no growth advantage was seen in the human neural stem cells expressing BCOR-ITD, and long-term models could not be established. In the murine cells, both wildtype BCOR and BCOR-ITD overexpression affected cellular differentiation and histone methylation, but only BCOR-ITD increased cellular growth, invasion, and migration. BCOR-ITD overexpression drives transcriptional changes, possibly due to altered PRC function, and contributes to the oncogenic transformation of neural precursors.

On the Complexity of Deadlock Recovery

1986 ◽  
Vol 9 (3) ◽  
pp. 323-342
Author(s):  
Joseph Y.-T. Leung ◽  
Burkhard Monien
Keyword(s):  
Computational Complexity ◽  
Polynomial Time ◽  
Arbitrary Number ◽  
The Other ◽  
Np Hard ◽  
Total Cost ◽  
Other Hand ◽  
Input Parameters ◽  
Resource Type

We consider the computational complexity of finding an optimal deadlock recovery. It is known that for an arbitrary number of resource types the problem is NP-hard even when the total cost of deadlocked jobs and the total number of resource units are “small” relative to the number of deadlocked jobs. It is also known that for one resource type the problem is NP-hard when the total cost of deadlocked jobs and the total number of resource units are “large” relative to the number of deadlocked jobs. In this paper we show that for one resource type the problem is solvable in polynomial time when the total cost of deadlocked jobs or the total number of resource units is “small” relative to the number of deadlocked jobs. For fixed m ⩾ 2 resource types, we show that the problem is solvable in polynomial time when the total number of resource units is “small” relative to the number of deadlocked jobs. On the other hand, when the total number of resource units is “large”, the problem becomes NP-hard even when the total cost of deadlocked jobs is “small” relative to the number of deadlocked jobs. The results in the paper, together with previous known ones, give a complete delineation of the complexity of this problem under various assumptions of the input parameters.

Sign in / Sign up

Export Citation Format

Share Document