Algorithms for Closest and Farthest String Problems via Rank Distance

Liviu P. Dinu, Bogdan Dumitru, Alexandru Popa 0001. Algorithms for Closest and Farthest String Problems via Rank Distance. In T. V. Gopal, Junzo Watada, editors, Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings. Volume 11436 of Lecture Notes in Computer Science, pages 154-171, Springer, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.