• 09/03/2020
  • Public Content

Life Science: Longest Common Subsequence

This sample finds the longest subsequence common to all sequences in two sequences. It demonstrates how to improve the performance of finding longest common subsequence using Intel® Cilk™ Plus. To demonstrate the performance increase, you will find two sequences to be stored in a single file separated by white-space. Let it as input, and assign an output file, you will get the longest common subsequence of two input sequences.
 
  • System Requirements
  • Hardware:
    • Any Intel processor with Intel® Advanced Vector Extensions (Intel® AVX) support like 2nd Generation Intel® Core™ i3, i5, or i7 processors and Intel® Xeon® E3 or E5 processor family, or newer
    For Microsoft* Windows*:
    • Microsoft* Visual Studio 2010* or 2012* standard edition or above
    • Intel® C++ Composer XE 2013 SP1 for Windows
    For Linux*:
    • GNU* GCC* 4.5 or newer
    • Intel® C++ Composer XE 2013 SP1 for Linux*
1

Product and Performance Information

1

Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserverd for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.

Notice revision #20110804