Cantor Mapping Technique

01/08/2021
by   Kaustubh Joshi, et al.
0

A new technique specific to String ordering utilizing a method called "Cantor Mapping" is explained in this paper and used to perform string comparative sort in loglinear time while utilizing linear extra space.

READ FULL TEXT

page 1

page 2

page 3

research
03/17/2020

A New Implementation of Manacher's Algorithm

Manacher's algorithm is optimal for the longest palindromic substring pr...
research
03/17/2020

An Efficient Implementation of Manacher's Algorithm

Manacher's algorithm has been shown to be optimal to the longest palindr...
research
06/15/2018

Enhanced string factoring from alphabet orderings

In this note we consider the concept of alphabet ordering in the context...
research
06/02/2021

Counting Lyndon Subsequences

Counting substrings/subsequences that preserve some property (e.g., pali...
research
06/24/2019

Dynamic Palindrome Detection

Lately, there is a growing interest in dynamic string matching problems....
research
08/11/2021

Practical evaluation of Lyndon factors via alphabet reordering

We evaluate the influence of different alphabet orderings on the Lyndon ...
research
09/23/2022

From String Detection to Orthogonal Vector Problem

Considering Grover's Search Algorithm (GSA) with the standard diffuser s...

Please sign up or login with your details

Forgot password? Click here to reset