Approximate word sequence matching over Sparse Suffix Trees

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/bfb0030781 ◽

1998 ◽

pp. 65-79 ◽

Cited By ~ 1

Author(s):

Knut Magne Risvik

Keyword(s):

Suffix Trees ◽

Sequence Matching ◽

Word Sequence

Download Full-text

Sequence Matching with Discriminative Binary Features for Robust and Fast Light-Rail Localization at High Frame Rate

2020 IEEE International Conference on Big Data (Big Data) ◽

10.1109/bigdata50022.2020.9378494 ◽

2020 ◽

Author(s):

Tingxian Wang ◽

Kebin Jia ◽

Meng Yao

Keyword(s):

Frame Rate ◽

Light Rail ◽

Sequence Matching ◽

High Frame Rate ◽

Binary Features ◽

Fast Light

Download Full-text

Analysis of Markov Models

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.462-463.243 ◽

2013 ◽

Vol 462-463 ◽

pp. 243-246

Author(s):

Chang Guang Shi

Keyword(s):

Markov Models ◽

Suffix Trees

Highly-available models and IPv4 have garnered improbable interest from both statisticians and experts in the last several years. Here, we show the emulation of suffix trees. We motivate an algorithm for suffix trees, which we use to demonstrate that e-business and replication can interact to solve this challenge.

Download Full-text

Serial-Parallel Combined All Optical Sequence Matching System Using Highly Nonlinear Fibers for Photonic Firewall

Optik ◽

10.1016/j.ijleo.2021.167571 ◽

2021 ◽

pp. 167571

Author(s):

Kehang Xu ◽

Xin Li ◽

Ying Tang ◽

Chaowei Yuan

Keyword(s):

Sequence Matching ◽

Nonlinear Fibers ◽

Highly Nonlinear ◽

All Optical

Download Full-text

Incorporating Protein Topology Information in Similarity Matrices for Improved Sequence Matching (A Fold-Specific Scoring System)

Biophysical Journal ◽

10.1016/j.bpj.2012.11.2804 ◽

2013 ◽

Vol 104 (2) ◽

pp. 508a

Author(s):

Sumudu P. Leelananda ◽

Robert L. Jernigan

Keyword(s):

Scoring System ◽

Sequence Matching ◽

Protein Topology ◽

Topology Information ◽

Similarity Matrices

Download Full-text

An efficient approach for sequence matching in large DNA databases

Journal of Information Science ◽

10.1177/0165551506059229 ◽

2006 ◽

Vol 32 (1) ◽

pp. 88-104 ◽

Cited By ~ 3

Author(s):

Jung-Im Won ◽

Sanghyun Park ◽

Jee-Hee Yoon ◽

Sang-Wook Kim

Keyword(s):

Sequence Matching ◽

Dna Databases ◽

Efficient Approach

Download Full-text

Clone detection using rolling hashing, suffix trees and dagification: A case study

2012 6th International Workshop on Software Clones (IWSC) ◽

10.1109/iwsc.2012.6227862 ◽

2012 ◽

Cited By ~ 3

Author(s):

Mikkel Jonsson Thomsen ◽

Fritz Henglein

Keyword(s):

Clone Detection ◽

Suffix Trees

Download Full-text

PSIST: A scalable approach to indexing protein structures using suffix trees

Journal of Parallel and Distributed Computing ◽

10.1016/j.jpdc.2007.07.008 ◽

2008 ◽

Vol 68 (1) ◽

pp. 54-63 ◽

Cited By ~ 6

Author(s):

Feng Gao ◽

Mohammed J. Zaki

Keyword(s):

Protein Structures ◽

Suffix Trees

Download Full-text

Sentiment analysis via integrating distributed representations of variable-length word sequence

Neurocomputing ◽

10.1016/j.neucom.2015.07.129 ◽

2016 ◽

Vol 187 ◽

pp. 126-132 ◽

Cited By ~ 13

Author(s):

Zhijian Cui ◽

Xiaodong Shi ◽

Yidong Chen

Keyword(s):

Sentiment Analysis ◽

Variable Length ◽

Distributed Representations ◽

Word Sequence

Download Full-text

Clone Detection Using Abstract Syntax Suffix Trees

2006 13th Working Conference on Reverse Engineering ◽

10.1109/wcre.2006.18 ◽

2006 ◽

Cited By ~ 125

Author(s):

Rainer Koschke ◽

Raimar Falke ◽

Pierre Frenzel

Keyword(s):

Clone Detection ◽

Abstract Syntax ◽

Suffix Trees

Download Full-text

The Average Profile of Suffix Trees

2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611972979.3 ◽

2007 ◽

Author(s):

Mark Daniel Ward

Keyword(s):

Suffix Trees ◽

Average Profile

Download Full-text