Quantum computers need vastly fewer resources than thought to break vital encryption

Building a utility-scale quantum computer that can crack one of the most vital cryptosystems—elliptic curves—doesn’t require ...
IEEE

An Efficient Parallel and Adaptive Algorithm for Large-Scale Multiple Longest Common Subsequence Problems

Abstract: The Multiple Longest Common Subsequence (MLCS) Problem is to find one or more longest common subsequences from multiple (≥ 3) strings. However, as the scale of the sequences increases, the ...
IEEE

A Improved PrefixSpan algorithm for sequential pattern mining

Abstract: Aiming at the problem of constructing huge amounts of projected databases in PrefixSpan algorithm, this paper proposes an Improved PrefixSpan algorithm for Mining Sequential Patterns, called ...