We prove that in a graph with n vertices, induced chordal and interval subgraphs with the maximum number of vertices can be found in time O(2 ^λn) for some λ< 1. These are the first algorithms breaking the trivial 2 ⁿn^O(1) bound of the brute-force search for these problems.