Author:
Cilibrasi Rudi,van Iersel Leo,Kelk Steven,Tromp John
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Alon, N., Sudakov, B.: On Two Segmentation Problems. Journal of Algorithms 33, 173–184 (1999)
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation - Combinatorial optimization problems and their approximability properties. Springer, Heidelberg (1999)
3. Bafna, V., Istrail, S., Lancia, G., Rizzi, R.: Polynomial and APX-hard cases of the individual haplotyping problem. Theoretical Computer Science (2004)
4. Bonizzoni, P., Della Vedova, G., Dondi, R., Li, J.: The Haplotyping Problem: An Overview of Computational Models and Solutions. Journal of Computer Science and Technology 18(6), 675–688 (2003)
5. Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering in large graphs via Singular Value Decomposition. Journal of Machine Learning 56, 9–33 (2004)
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献