The Quasiperiodic Automated Transit Search Algorithm
Joshua Carter

I will present a new algorithm for detecting transiting extrasolar planets in time-series photometry. The Quasiperiodic Automated Transit Search (QATS) algorithm relaxes the usual assumption of strictly periodic transits by permitting a variable, but bounded, interval between successive transits. I show that this method is capable of detecting transiting planets with significant transit timing variations without any loss of significance --- "smearing" ---- as would be incurred with traditional algorithms, at the cost of a slightly increased stochastic background. Applications of QATS include transiting planets in dynamically active multi-planet systems and transiting planets in stellar binary systems. Despite the increased flexibility, QATS has a run-time complexity that is comparable to traditional search codes and is comparably easy to implement. QATS is applicable to data having a nearly uninterrupted, uniform cadence and is therefore well suited to the modern class of space-based transit searches (e.g., Kepler, CoRoT, TESS). I will present the detection of Kepler-36b with the QATS algorithm and describe ongoing efforts to canvas the entire Kepler data set with QATS.