LCS Algorithm

in Study / Rosalind on Motifs

For finding the LCS from 2 DNA sequences

  • LCS has 2 meanings
    • The Longest Common Substring
      • From 2 strings, we extract the longest common substring (need to be continuous)
    • The Longest Common Subsequence
      • From 2 strings, we extract the longest common subsequence (don’t need to be continuous)
  • Using LCS Algorithm -> we can guess the longest candidate motif between 2 sequences
    • substring : not considering the mutation
    • subsequence : considering the mutation

Overlap Graphs

in Study / Rosalind on Rosalind problem

A problem from rosalind “Bioinformatics Stronghold” category, String Algorithm

Pagination

© 2017. All rights reserved.

Powered by Hydejack v조현진