We introduce the train tree representation of an interval graph, which is based on the clique-separator graph representation of a chordal graph. The train tree is the basis of the first dynamic algorithm to recognize interval graphs, and it may lead to fast dynamic algorithms for numerous problems on interval graphs, which have applications in areas such as computational biology, archeology, psychology, and scheduling.