Pyramid Search: Skip Ring Data Structure-Based New Searching Algorithm

Our new algorithm and data structure, pyramid search (PS) and skip ring, were created with the help of circular linked list and skip list algorithms and data structures. In circular linked list, operations were performed on a single circular list. Our new data structure consists of circular linked lists formed in layers which were linked in a pyramid way. Time complexity of searching, insertion and deletion algorithms equal to [Formula: see text] (lg[Formula: see text]) in an [Formula: see text]-element skip ring data structure. Therefore, skip ring data structure is employed more effectively ([Formula: see text](lg[Formula: see text])) in circumstances where circular linked lists ([Formula: see text]) are used. The priority is determined based on the searching frequency in PS which was developed in this study. Thus, the time complexity of searching is almost [Formula: see text](1) for [Formula: see text] records data set. In this paper, the applications of searching algorithms like linear search (LS), binary search (BS) and PS were realized and the obtained results were compared. The obtained results demonstrated that the PS algorithm is superior to the BS algorithm.

Download Full-text

Verification of Attributes in Linked Lists Using Ant Colony Metaphor

Evolutionary Computation and Optimization Algorithms in Software Engineering ◽

10.4018/978-1-61520-809-8.ch012 ◽

2010 ◽

pp. 220-228

Author(s):

Soumya Banerjee ◽

P. K. Mahanti

Keyword(s):

Data Structure ◽

Ant Colony Algorithm ◽

Predicate Logic ◽

Device Driver ◽

Ant Colony ◽

Linked List ◽

Exploration Strategy ◽

Local Propagation ◽

Learning Parameter ◽

Linked Lists

The chapter describes the validation of the attributes of linked list using modified pheromone biased model (of Ant colony) under complex application environment mainly for kernel configuration and device driver operations. The proposed approach incorporates the idea of pheromone exploration strategy with small learning parameter associated while traversing a linked list. This process of local propagation on loop and learning on traversal is not available with the conventional validation mechanism of data structure using predicate logic. It has also been observed from simulation that the proposed ant colony algorithm with different pheromone value produces better convergence on linked list.

Download Full-text

d-PBWT: dynamic positional Burrows-Wheeler transform

10.1101/2020.01.14.906487 ◽

2020 ◽

Author(s):

Ahsan Sanaullah ◽

Degui Zhi ◽

Shaojie Zhang

Keyword(s):

Data Structure ◽

Time Complexity ◽

Linear Time ◽

Genotype Imputation ◽

Worst Case ◽

Average Case ◽

Insertion And Deletion ◽

Static Data ◽

Efficient Retrieval ◽

Burrows Wheeler Transform

AbstractDurbin’s PBWT, a scalable data structure for haplotype matching, has been successfully applied to identical by descent (IBD) segment identification and genotype imputation. Once the PBWT of a haplotype panel is constructed, it supports efficient retrieval of all shared long segments among all individuals (long matches) and efficient query between an external haplotype and the panel. However, the standard PBWT is an array-based static data structure and does not support dynamic updates of the panel. Here, we generalize the static PBWT to a dynamic data structure, d-PBWT, where the reverse prefix sorting at each position is represented by linked lists. We developed efficient algorithms for insertion and deletion of individual haplotypes. In addition, we verified that d-PBWT can support all algorithms of PBWT. In doing so, we systematically investigated variations of set maximal match and long match query algorithms: while they all have average case time complexity independent of database size, they have different worst case complexities, linear time complexity with the size of the genome, and dependency on additional data structures.

Download Full-text

Binary Search In Linked List

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.d7296.118419 ◽

2019 ◽

Vol 8 (4) ◽

pp. 2684-2686

Keyword(s):

Time Complexity ◽

Binary Search ◽

Divide And Conquer ◽

Linear Search ◽

Linked List

This paper is based on an approach to implement Binary Search in Linked List. Binary Search is divide and conquer approach to search an element from the list of sorted element. In Linked List we can do binary search but it has time complexity O(n) that is same as what we have for linear search which makes Binary Search inefficient to use in Linked List. The main problem that binary search takes O(n) time in Linked List due to fact that in linked list we are not able to do indexing which led traversing of each element in Linked list take O(n) time. In this paper a method is implemented through which binary search can be done with time complexity of O(log2n). This is done with the help of auxiliary array. Auxiliary array helps in indexing of linked list through which one can traverse a node in O(1) complexity hence reducing the complexity of binary search to O(log2n) hence increasing efficiency of binary search in linked

Download Full-text

Dynamic Generalized Suffix Arrays

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.263-266.1398 ◽

2012 ◽

Vol 263-266 ◽

pp. 1398-1401

Author(s):

Song Feng Lu ◽

Hua Zhao

Keyword(s):

Data Structure ◽

Pattern Matching ◽

Time Complexity ◽

Document Retrieval ◽

Suffix Array ◽

Index Structure ◽

Suffix Arrays ◽

Basic Task ◽

Insertion And Deletion ◽

Dynamic Version

Document retrieval is the basic task of search engines, and seize amount of attention by the pattern matching community. In this paper, we focused on the dynamic version of this problem, in which the text insertion and deletion is allowable. By using the generalized suffix array and other data structure, we proposed a new index structure. Our scheme achieved better time complexity than the existing ones, and a bit more space overhead is needed as return.

Download Full-text

A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition

International Journal of Mathematical Models and Methods in Applied Sciences ◽

10.46300/9101.2022.16.4 ◽

2022 ◽

Vol 16 ◽

pp. 23-27

Author(s):

Mehrnoosh Bazrafkan

Keyword(s):

Pattern Recognition ◽

Data Structure ◽

Time Complexity ◽

Theoretic Approach ◽

Top Down ◽

Syntactic Pattern Recognition ◽

Context Free Grammar ◽

Linked List ◽

Syntactic Pattern ◽

Context Free

The numerous different mathematical methods used to solve pattern recognition snags may be assembled into two universal approaches: the decision-theoretic approach and the syntactic(structural) approach. In this paper, at first syntactic pattern recognition method and formal grammars are described and then has been investigated one of the techniques in syntactic pattern recognition called top – down tabular parser known as Earley’s algorithm Earley's tabular parser is one of the methods of context -free grammar parsing for syntactic pattern recognition. Earley's algorithm uses array data structure for implementing, which is the main problem and for this reason takes a lots of time, searching in array and grammar parsing, and wasting lots of memory. In order to solve these problems and most important, the cubic time complexity, in this article, a new algorithm has been introduced, which reduces wasting the memory to zero, with using linked list data structure. Also, with the changes in the implementation and performance of the algorithm, cubic time complexity has transformed into O (n*R) order. Key words: syntactic pattern recognition, tabular parser, context –free grammar, time complexity, linked list data structure.

Download Full-text

Binary Search In Linked List

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.a9775.109119 ◽

2019 ◽

Vol 9 (1) ◽

pp. 3151-3153

Keyword(s):

Time Complexity ◽

Binary Search ◽

Divide And Conquer ◽

Linear Search ◽

Linked List

This paper is based on an approach to implement Binary Search in Linked List. Binary Search is divide and conquer approach to search an element from the list of sorted element. In Linked List we can do binary search but it has time complexity O(n) that is same as what we have for linear search which makes Binary Search inefficient to use in Linked List. The main problem that binary search takes O(n) time in Linked List due to fact that in linked list we are not able to do indexing which led traversing of each element in Linked list take O(n) time.In this paper a method is implemented through which binary search can be done with time complexity of O(log2n). This is done with the help of auxiliary array. Auxiliary array helps in indexing of linked list through which one can traverse a node in O(1) complexity hence reducing the complexity of binary search to O(log2n) hence increasing efficiency of binary search in linked List.

Download Full-text

Design and Implementation of Multiple Linked Lists Sharing the same Memory

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.706-708.1936 ◽

2013 ◽

Vol 706-708 ◽

pp. 1936-1940

Author(s):

Yong Ping Gao ◽

Jun Zhang

Keyword(s):

Time Complexity ◽

Data Type ◽

Storage Space ◽

Complexity Of Algorithms ◽

Design And Implementation ◽

Linked List ◽

Specific Implementation ◽

Linked Lists

In some languages, because there is no pointer data type, so the single linked list is described by the use of the array. When there are multiple nodes of the same type list, these lists can share the same static linked list of memory, so it can mutually adjust the remaining places to reduce the overflow space. To solve practical problems, this paper is designed from the static linked list sharing the same storage space, the constructor, inserting operations, deleting operations, and it puts up forward a suggestion of its specific implementation and analyzes time complexity of algorithms and its significances.

Download Full-text

An Investigation of Vector and Parallel Processing Applied to Solid Modeling

Volume 1: Design for Manufacturing Conference ◽

10.1115/96-detc/dfm-1284 ◽

1996 ◽

Author(s):

Navin Pai ◽

Mark Henderson

Keyword(s):

Data Structure ◽

Parallel Processing ◽

Solid Modeling ◽

Boundary Representation ◽

Solid Modeler ◽

Linked Lists

Abstract Solid modeling is a very useful industrial tool in the manufacture and design of industrial parts and assemblies. As a tool in the industrial workplace it has to be able to respond quickly to changes in design. To do this, the intersection algorithms between the solids have to be speeded up. Optimizations such as vector and parallel processing traditionally supported by supercomputers have the potential to solve this problem. A solid modeler was developed based on the boundary representation approach using a half-edge data structure. Those parts of the solid modeler code that could be vectorized were identified. A method was tested which allows loops involving linked lists to vectorize. It was also shown that this solid modeler has an inherent parallelism that can be exploited. Results are presented for vectorization and parallelization. The practical limits to both vectorization and parallelization are highlighted. Improvements to the geometric intersections algorithms are suggested to take advantage of vector and parallel processing. Results of the speedups possible using these algorithms are presented.

Download Full-text