J
John Kececioglu
Researcher at University of Arizona
Publications - 78
Citations - 3261
John Kececioglu is an academic researcher from University of Arizona. The author has contributed to research in topics: Multiple sequence alignment & Estimator. The author has an hindex of 24, co-authored 74 publications receiving 3088 citations. Previous affiliations of John Kececioglu include University of Georgia & National Institutes of Health.
Papers
More filters
Journal ArticleDOI
A tool for multiple sequence alignment
TL;DR: The design and application of a tool for multiple alignment of amino acid sequences that implements a new algorithm that greatly reduces the computational demands of dynamic programming is described.
Journal ArticleDOI
Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement
John Kececioglu,David Sankoff +1 more
TL;DR: The greedy algorithm is the first to come within a constant factor of the optimum; it guarantees a solution that uses no more than twice the minimum number of reversals, and the lower and upper bounds of the branch- and-bound algorithm are a novel application of maximum-weight matchings, shortest paths, and linear programming.
Journal ArticleDOI
Combinatorial algorithms for DNA sequence assembly
John Kececioglu,Eugene W. Myers +1 more
TL;DR: A four-phase approach based on rigorous design criteria is presented, and has been found to be very accurate in practice and can accommodate high sequencing error rates.
Journal ArticleDOI
Multiple alignment by aligning alignments
TL;DR: A new tool is produced that on benchmark alignments matches the quality of the top tools, without employing alignment consistency or hydrophobic gap penalties, and is freely available at http://opal.cs.arizona.edu.
Proceedings ArticleDOI
Dynamic path-based software watermarking
Christian Collberg,Edward Carter,Saumya K. Debray,A. Huntwork,John Kececioglu,Cullen Linn,Michael Stepp +6 more
TL;DR: Results indicate that even relatively large watermarks can be embedded into programs at modest cost and error-correcting and tamper-proofing techniques can be used to make path-based watermarks resilient against a wide variety of attacks.