5 citations · 12 across the 5 of their papers we have counts for
5 papers · 1 filter
Computing alignment plots efficiently
Peter Krusche, Alexander Tiskin
Dot plots are a standard method for local comparison of biological sequences. In a dot plot, a substring to substring distance is computed for all pairs of fixed-size windows in th…
String comparison by transposition networks
Peter Krusche, Alexander Tiskin
Computing string or sequence alignments is a classical method of comparing strings and has applications in many areas of computing, such as signal processing and bioinformatics. Se…
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Vladimir Deineko, Alexander Tiskin
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of T…
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
Vladimir Deineko, Alexander Tiskin
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of T…
Faster exon assembly by sparse spliced alignment
Alexander Tiskin
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is \emph{spliced alignment}, proposed…