Tighter upper bound for sorting permutations with prefix transpositions.
Bhadrachalam ChitturiPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- upper bound
- lower bound
- data structure
- upper and lower bounds
- worst case
- branch and bound
- lower and upper bounds
- branch and bound algorithm
- prefix tree
- database
- active learning
- tree structure
- probability distribution
- training set
- data streams
- database systems
- artificial intelligence
- information retrieval
- real world
- data sets