Building and Checking Suffix Array Simultaneously by Induced Sorting Method

2021 ◽  
pp. 1-1
Author(s):  
Bin Lao ◽  
Yi Wu ◽  
Ge Nong ◽  
Wai Hong Chan
Keyword(s):  
Suffix Array ◽  
Sorting Method

Communicating the Value of Design

2019 ◽  
Vol 2 (1) ◽  
Author(s):  
George Edward TORRENS ◽  
Nicholas Samuel JOHNSON ◽  
Ian STORER
Keyword(s):  
Design Decision ◽  
Card Sorting ◽  
Practical Application ◽  
Product Packaging ◽  
Sorting Method ◽  
Packaging Design ◽  
Design Considerations ◽  
Modified Delphi ◽  
Fast Moving Consumer Goods ◽  
Comprehensive Framework

Product packaging design is often produced through the practical application of tacit knowledge, rule of thumb and professional connoisseurship. Stakeholders are becoming increasingly demanding that design practitioners provide clarity of reasoning and accountability for their design proposals. Therefore, a better framework for the design of fast-moving consumer goods (FMCG) is required. This paper proposes a comprehensive taxonomy of ‘design considerations’ to assist the development of low involvement FMCG packaging and aid in rationale communication for design solutions. 302 academic sources were reviewed, inductive content analysis performed to code topics and output validation with academic and industry experts (n=9) through a modified-Delphi card sorting method. The research provides movement towards a comprehensive framework and common dialogue between stakeholders, practitioners and managers to assist in more effectively communicating the value that design can offer to FMCGs. The constructed taxonomy provides a set of 156 ‘design considerations’ to support in objective and informed design decision-making.

An Efficient Tool for Searching Maximal and Super Maximal Repeats in Large DNA/Protein Sequences via Induced-Enhanced Suffix Array

2019 ◽  
Vol 12 (2) ◽  
pp. 128-134
Author(s):  
Sanjeev Kumar ◽  
Suneeta Agarwal ◽  
Ranvijay
Keyword(s):  
Protein Sequences ◽  
Input Sequence ◽  
Suffix Array ◽  
Secondary Memory ◽  
Time And Space ◽  
Efficient Tool ◽  
Frequency Distributions ◽  
Alignment Algorithms ◽  
Common Prefix ◽  
Art Works

Background: DNA and Protein sequences of an organism contain a variety of repeated structures of various types. These repeated structures play an important role in Molecular biology as they are related to genetic backgrounds of inherited diseases. They also serve as a marker for DNA mapping and DNA fingerprinting. Efficient searching of maximal and super maximal repeats in DNA/Protein sequences can lead to many other applications in the area of genomics. Moreover, these repeats can also be used for identification of critical diseases by finding the similarity between frequency distributions of repeats in viruses and genomes (without using alignment algorithms). Objective: The study aims to develop an efficient tool for searching maximal and super maximal repeats in large DNA/Protein sequences. Methods: The proposed tool uses a newly introduced data structure Induced Enhanced Suffix Array (IESA). IESA is an extension of enhanced suffix array. It uses induced suffix array instead of classical suffix array. IESA consists of Induced Suffix Array (ISA) and an additional array-Longest Common Prefix (LCP) array. ISA is an array of all sorted suffixes of the input sequence while LCP array stores the lengths of the longest common prefixes between all pairs of consecutive suffixes in an induced suffix array. IESA is known to be efficient w.r.t. both time and space. It facilitates the use of secondary memory for constructing the large suffix-array. Results: An open source standalone tool named MSR-IESA for searching maximal and super maximal repeats in DNA/Protein sequences is provided at https://github.com/sanjeevalg/MSRIESA. Experimental results show that the proposed algorithm outperforms other state of the art works w.r.t. to both time and space. Conclusion: The proposed tool MSR-IESA is remarkably efficient for the analysis of DNA/Protein sequences, having maximal and super maximal repeats of any length. It can be used for identification of well-known diseases.

Hybrid Bucket Sorting Method for Successive Cancellation List Decoding of Polar Codes

2019 ◽  
Vol 23 (10) ◽  
pp. 1757-1760
Author(s):  
Jiahao Wang ◽  
Zhenyu Hu ◽  
Ning An ◽  
Dunfan Ye
Keyword(s):  
Polar Codes ◽  
List Decoding ◽  
Sorting Method ◽  
Successive Cancellation

Suffix array for multi-pattern matching with variable length wildcards

2021 ◽  
Vol 25 (2) ◽  
pp. 283-303
Author(s):  
Na Liu ◽  
Fei Xie ◽  
Xindong Wu
Keyword(s):  
Dynamic Programming ◽  
Data Structure ◽  
Pattern Matching ◽  
Edit Distance ◽  
State Of The Art ◽  
Suffix Array ◽  
Variable Length ◽  
Distance Method ◽  
Efficient Data ◽  
Comparison Algorithms

Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact string matching in existing studies, as well as for approximate pattern matching and multi-pattern matching. An algorithm called MMSA-S is for the short exact characters in a pattern by dynamic programming, while another algorithm called MMSA-L deals with the long exact characters by the edit distance method. Experimental results of Pizza & Chili corpus demonstrate that these two newly proposed algorithms, in most cases, are more time-efficient than the state-of-the-art comparison algorithms.

Research of Lithium-Ion Battery Sorting Method Based on Fuzzy C-Means Algorithm

2011 ◽  
Vol 354-355 ◽  
pp. 983-988 ◽  
Author(s):  
Lei Guo ◽  
Gen Wang Liu
Keyword(s):  
Lithium Ion Battery ◽  
Lithium Ion ◽  
Test System ◽  
Cluster Number ◽  
Sorting Method ◽  
Fuzzy C Means ◽  
Weighted Index ◽  
Fuzzy C Means Algorithm

A method that applies Fuzzy C-Means algorithm (FCM) in lithium-ion battery sorting in formation and test system is presented. The original Fuzzy C-Means algorithm is optimized, and weighted index m and cluster number c are analyzed. Through battery sorting experiment, this method is verified to be feasible and practical.

scholarly journals A degradation-based sorting method for lithium-ion battery reuse

PLoS ONE ◽  
2017 ◽  
Vol 12 (10) ◽  
pp. e0185922 ◽  
Author(s):  
Hao Chen ◽  
Julia Shen
Keyword(s):  
Lithium Ion Battery ◽  
Lithium Ion ◽  
Sorting Method
Sign in / Sign up

Export Citation Format

Share Document