Login / Signup
Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences.
Bob P. Weems
Yongsheng Bai
Published in:
FCS (2005)
Keyphrases
</>
information retrieval
sequence analysis
hidden markov models
pattern matching
uniformly distributed
randomly generated
pseudorandom
method finds
real time
application scenarios
suffix array
long sequences