Consensus Optimizing Both Distance Sum and Radius-Reference-Cited by-同舟云学术

Consensus Optimizing Both Distance Sum and Radius

Published:2009 Issue: Volume: Page:234-242
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Amir Amihood,Landau Gad M.,Na Joong Chae,Park Heejin,Park Kunsoo,Sim Jeong Seop

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03784-9_23

Reference16 articles.

1. Altschul, S., Lipman, D.: Trees, stars, and multiple sequence alignment. SIAM Journal on Applied Mathematics 49, 197–209 (1989)

2. Lecture Notes in Computer Science;A. Ben-Dor,1997

3. Lecture Notes in Computer Science;C. Boucher,2008

4. Frances, M., Litman, A.: On covering problems of codes. Theory of Computing Systems 30(2), 113–119 (1997)

5. Gasieniec, L., Jansson, J., Lingas, A.: Efficient approximation algorithms for the Hamming center problem. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 905–906 (1999)

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

1. Determining 2-Optimality Consensus for DNA Structure;Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices;2021

2. Configurations and Minority in the String Consensus Problem;Algorithmica;2015-04-17

3. On the Efficiency of the Hamming C-Centerstring Problems;Combinatorial Pattern Matching;2014

4. On the hardness of the Consensus String problem;Information Processing Letters;2013-05

5. An Efficient Algorithm for Rank Distance Consensus;AI*IA 2013: Advances in Artificial Intelligence;2013