A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance-Reference-Cited by-同舟云学术

A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance

Published:2011 Issue: Volume: Page:297-305
ISSN:0302-9743
Container-title:Bioinformatics Research and Applications
language:
Short-container-title:

Author:

Fu Bin,Zhang Louxin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-21260-4_29

Reference19 articles.

1. Lecture Notes in Bioinformatics;S. Angibaud,2007

2. Angibaud, S., Fertin, G., Rusu, I., Thévenin, A., Vialette, S.: On the ap-proximability of comparing genomes with duplicates. J. Graph Algor. Appli. (accepted)

3. Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: A computational complexity point of view. IEEE/ACM IEEE Trans. Comput. Biol. Bioinform. 4, 523–534 (2007)

4. Lecture Notes in Computer Science;G. Blin,2009

5. Bryant, D.: The complexity of calculating exemplar distance. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207–212 (2000)

Cited by 6 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 Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance;Journal of Computational Biology;2015-07

4. A Dynamic Programming Algorithm for Unsigned (1,2)-Exemplar Breakpoint Distance Problem with Span Constraint;2013 Sixth International Conference on Business Intelligence and Financial Engineering;2013-11

5. An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2013-11