Title
Algorithms for Closest and Farthest String Problems via Rank Distance.
Abstract
A new distance between strings, termed rank distance, was introduced by Dinu (Fundamenta Informaticae, 2003). Since then, the properties of rank distance were studied in several papers. In this article, we continue the study of rank distance. More precisely we tackle three problems that concern the distance between strings.
Year
DOI
Venue
2019
10.1007/978-3-030-14812-6_10
TAMC
Field
DocType
Citations 
Discrete mathematics,Combinatorics,Computer science
Conference
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Liviu P. Dinu116435.89
Bogdan Dumitru201.01
Alexandru Popa37013.34