Using only string methods, devise a way to determine if a nucleotide sequence is a palindrome in the sense that it is equal to its own complementary sequence read backwards. For example, the sequence TGGATCCA is palindromic because its complement is ACCTAGGT, which is the same as the original sequence backwards. The complementary base pairs are (A,T) and (C,G)

Longest Common Subsequence:ExampleLCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3.LCS for input Sequences “AGGTAB” and “GXTXAYB” is “GTAB” of length 4.Implementation in Java.

A cyclic permutation of a string takes the string and shifts each letter forward by a constant amount k, with letters that shift off the end of the string coming back in at the front. For instance, the cyclic permutations of the string ABCDEF are FABCDE, EFABCD, DEFABC, CDEFAB, BCDEFA, and ABCDEF itself. A reverse cyclic permutation is the reverse of a cyclic permutation; for instance ABCDEF has the reverse cyclic permutation DCBAFE amongst others. Given two strings S and S", provide a linear time algorithm to decide whether S is a reverse cyclic permutation of S'.

If we are given with the two strings we have to find the longest common sub-sequence present in both of them.ExampleLCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3.LCS for input Sequences “AGGTAB” and “GXTXAYB” is “GTAB” of length 4.Implementation in Java