Approximate word sequence matching over Sparse Suffix Trees

1998 ◽  
pp. 65-79 ◽  
Author(s):  
Knut Magne Risvik
Keyword(s):  
Suffix Trees ◽  
Sequence Matching ◽  
Word Sequence

Analysis of Markov Models

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.

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

Optik ◽  
2021 ◽  
pp. 167571
Author(s):  
Kehang Xu ◽  
Xin Li ◽  
Ying Tang ◽  
Chaowei Yuan
Keyword(s):  
Sequence Matching ◽  
Nonlinear Fibers ◽  
Highly Nonlinear ◽  
All Optical

An efficient approach for sequence matching in large DNA databases

2006 ◽  
Vol 32 (1) ◽  
pp. 88-104 ◽  
Author(s):  
Jung-Im Won ◽  
Sanghyun Park ◽  
Jee-Hee Yoon ◽  
Sang-Wook Kim
Keyword(s):  
Sequence Matching ◽  
Dna Databases ◽  
Efficient Approach

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

2008 ◽  
Vol 68 (1) ◽  
pp. 54-63 ◽  
Author(s):  
Feng Gao ◽  
Mohammed J. Zaki
Keyword(s):  
Protein Structures ◽  
Suffix Trees

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

2016 ◽  
Vol 187 ◽  
pp. 126-132 ◽  
Author(s):  
Zhijian Cui ◽  
Xiaodong Shi ◽  
Yidong Chen
Keyword(s):  
Sentiment Analysis ◽  
Variable Length ◽  
Distributed Representations ◽  
Word Sequence

Clone Detection Using Abstract Syntax Suffix Trees

2006 ◽  
Author(s):  
Rainer Koschke ◽  
Raimar Falke ◽  
Pierre Frenzel
Keyword(s):  
Clone Detection ◽  
Abstract Syntax ◽  
Suffix Trees
Sign in / Sign up

Export Citation Format

Share Document