Fast multisegment alignments for temporal expression profiles

Adam A Smith, Mark Craven
2008 Computational systems bioinformatics. Computational Systems Bioinformatics Conference  
We present two heuristics for speeding up a time series alignment algorithm that is related to dynamic time warping (DTW). In previous work, we developed our multisegment alignment algorithm to answer similarity queries for toxicogenomic time-series data. Our multisegment algorithm returns more accurate alignments than DTW at the cost of time complexity; the multisegment algorithm is O(n(5)) whereas DTW is O(n(2)). The first heuristic we present speeds up our algorithm by a constant factor by
more » ... stricting alignments to a cone shape in alignment space. The second heuristic restricts the alignments considered to those near one returned by a DTW-like method. This heuristic adjusts the time complexity to O(n(3)). Importantly, neither heuristic results in a loss in accuracy.
pmid:19642291 pmcid:PMC2766602 fatcat:v3272mgndzho5khvadcmnnieoq