Art && Process
  • About
  • Email
  • Portfolio
  • Github
  • Vimeo
Home » dynamic programming

Remember Me to One Who Lives There

November 19, 2012 · by Kim Ash · in Makematics

One application of dynamic programming is finding the longest common subsequence of two strings. Greg’s example from class applied this principle to sequences of DNA, where it can indicate mutations. I thought it might be interesting to try this with…

Categories

  • 30 Works in 30 Days (1)
  • Big Screens (2)
  • Conversational Spaces (2)
  • Thesis (3)
  • Comm Lab (4)
  • Dynamic Web (4)
  • 3D Sensing and Visualization (4)
  • Reading and Writing Electronic Text (5)
  • Generative Systems (6)
  • ICM (7)
  • Nature of Code (8)
  • Printing Code (10)
  • Computational Cameras (10)
  • Makematics (11)
  • PComp (12)

Tags