On Machine Learning Approach Towards Sorting Permutations by Block Transpositions

机译：块换位机器学习方法对排序排列

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

Sorting permutations by transposition are a well-studied combinatorial optimization problem having applications in comparative genomics. The problem belongs to the NP-hard class, and several approximation algorithms are existent. Altinier, Oliveira and Dias proposed a machine learning approach for sorting permutations by two types of rearrangement operations, namely reversals and block transpositions. This paper discusses an application of their approach for sorting permutations by using a single operation, namely transposition under an improved setting. It also discusses the application of the method on permutations from toric equivalence classes and shows that comparable results with lesser computation overhead can be obtained.

机译：通过转置分选排序是具有在比较基因组学中具有应用的良好研究的组合优化问题。问题属于NP-Hard类，并且存在几个近似算法。 Altinier，Oliveira和Dia提出了一种机器学习方法，用于通过两种类型的重排操作进行分类，即逆转和块转换。本文通过使用单一操作来讨论它们对排序排列的方法，即在改进的设置下的转换。它还讨论了方法在从复合等效类别的排列上的应用，并且可以获得具有较小计算开销的可比结果。

著录项

来源
《International Conference in Advances in Electrical and Computer Technologies》|2019年|159-169|共11页
会议地点
作者
P. Jayakumar; Sooraj Soman; V. Harikrishnan;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类
关键词
Permutations; Sorting; Transpositions; SGD classifier; Machine learning;

机译：排列;排序;换位;SGD分类器;机器学习;

相似文献

外文文献
中文文献
专利

1. A 2-Approximation Scheme for Sorting Signed Permutations by Reversals, Transpositions, Transreversals, and Block-Interchanges [J] . Hao FanChang, Zhang Melvin, Leong Hon Wai IEEE/ACM transactions on computational biology and bioinformatics . 2019,第5期

机译：通过逆序，换位，逆转和块交换对带符号排列进行排序的2近似方案
2. Extracting and reusing blocks of knowledge in learning classifier systems for text classification: a lifelong machine learning approach [J] . Arif Muhammad Hassan, Iqbal Muhammad, Li Jianxin Soft computing: A fusion of foundations, methodologies and applications . 2019,第23期

机译：在学习分类系统中提取和重用知识块进行文本分类：终身机器学习方法
3. An Upper Bound For Sorting Permutations With A Transposition Tree [J] . Devika K Das, Bhadrachalam Chitturi, Sai Satwik Kuppili Procedia Computer Science . 2020,第5期

机译：用换置树排序排序的上限
4. Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges [C] . Jianxing Feng, Darning Zhu International Conference on Theory and Applications of Models of Computation(TAMC 2006); 20060515-20; Beijing(CN) . 2006

机译：按换位排序和按块互换排序的更快算法
5. Algorithm selection for sorting and probabilistic inference: A machine learning-based approach. [D] . Guo, Haipeng. 2003

机译：排序和概率推理的算法选择：一种基于机器学习的方法。
6. CAMELOT: A machine learning approach for coarse-grained simulations of aggregation of block-copolymeric protein sequences [O] . Kiersten M. Ruff, Tyler S. Harmon, Rohit V. Pappu -1

机译：CAMELOT：一种机器学习方法用于粗粒模拟嵌段共聚物蛋白序列的聚集
7. An Upper Bound on the Number of Circular Transpositions to Sort a Permutation [O] . van Zuylen, Anke, Bieron, James, Schalekamp, Frans, 2014

机译：排序a的圆形换位数的上界排列

On Machine Learning Approach Towards Sorting Permutations by Block Transpositions

摘要

著录项

相似文献

相关主题

期刊订阅