V-Order: New combinatorial properties & a simple comparison algorithm
نویسندگان
چکیده
منابع مشابه
String Comparison in V-Order: New Lexicographic Properties & On-line Applications
V -order is a global order on strings related to Unique Maximal Factorization Families (UMFFs) [6,7], which are themselves generalizations of Lyndon words [14]. V -order has recently been proposed as an alternative to lexicographical order in the computation of suffix arrays and in the suffix-sorting induced by the Burrows-Wheeler transform. Efficient V -ordering of strings thus becomes a matte...
متن کاملA New Optimization Algorithm For Combinatorial Problems
Combinatorial optimization problems are those problems that have a finite set of possible solutions. The best way to solve a combinatorial optimization problem is to check all the feasible solutions in the search space. However, checking all the feasible solutions is not always possible, especially when the search space is large. Thus, many meta-heuristic algorithms have been devised and modifi...
متن کاملA Simple Combinatorial Algorithm for de Bruijn Sequences
This note presents a combinatorial method to construct a De Bruijn cycle for any order n.
متن کاملA simple combinatorial algorithm for submodular function minimization
This paper presents a new simple algorithm for minimizing submodular functions. For integer valued submodular functions, the algorithm runs in O(nEO log nM) time, where n is the cardinality of the ground set, M is the maximum absolute value of the function value, and EO is the time for function evaluation. The algorithm can be improved to run in O((nEO+n) log nM) time. The strongly polynomial v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.07.006