A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance
Author:
Affiliation:
1. School of Computer Science and Technology, Shandong University, Jinan, China.
2. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong.
Publisher
Mary Ann Liebert Inc
Subject
Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modelling and Simulation
Link
http://www.liebertpub.com/doi/pdf/10.1089/cmb.2014.0200
Reference17 articles.
1. Color-coding
2. On the Approximability of Comparing Genomes with Duplicates
3. Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes
4. Comparing Genomes with Duplications: A Computational Complexity Point of View
5. The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Longest Order Conserved Repetition-free Subsequences;2023 IEEE International Conference on Bioinformatics and Biomedicine (BIBM);2023-12-05
2. Longest Order Conserved Exemplar Subsequences;2020-12-15
3. A Tractable Variant of the Single Cut or Join Distance with Duplicated Genes;Comparative Genomics;2017
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3