The transposition median problem is NP-complete-Reference-Cited by-同舟云学术

The transposition median problem is NP-complete

Published:2011-03 Issue:12-14 Volume:412 Page:1099-1110
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bader Martin

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference35 articles.

1. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution;Pevzner;Proceedings of the National Academy of Sciences,2003

2. Multiple genome rearrangement and breakpoint phylogeny;Sankoff;Journal of Computational Biology,1998

3. I. Pe’er, R. Shamir, The median problems for breakpoints are NP-complete, Tech. Rep. TR98-071, Electronic Colloquium on Computational Complexity, 1998.

4. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study;Bader;Journal of Computational Biology,2001

5. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data;Moret,2002

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Genome Rearrangement Analysis;Methods in Molecular Biology;2024

2. Generalized Median Computation for Consensus Learning: A Brief Survey;Computer Analysis of Images and Patterns;2023

3. Kernel-Based Generalized Median Computation for Consensus Learning;IEEE Transactions on Pattern Analysis and Machine Intelligence;2022

4. Partition–Mallows Model and Its Inference for Rank Aggregation;Journal of the American Statistical Association;2021-07-08

5. A lower bound for generalized median based consensus learning using kernel-induced distance functions;Pattern Recognition Letters;2020-12