2008 |
30 | EE | Eagu Kim,
John D. Kececioglu:
Learning Scoring Schemes for Sequence Alignment from Partial Examples.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 546-556 (2008) |
2007 |
29 | EE | Travis J. Wheeler,
John D. Kececioglu:
Multiple alignment by aligning alignments.
ISMB/ECCB (Supplement of Bioinformatics) 2007: 559-568 |
28 | EE | Eagu Kim,
John D. Kececioglu:
Inverse Sequence Alignment from Partial Examples.
WABI 2007: 359-370 |
2006 |
27 | EE | John D. Kececioglu,
Eagu Kim:
Simple and Fast Inverse Alignment.
RECOMB 2006: 441-455 |
2004 |
26 | EE | Christian S. Collberg,
Edward Carter,
Saumya K. Debray,
Andrew Huntwork,
John D. Kececioglu,
Cullen Linn,
Michael Stepp:
Dynamic path-based software watermarking.
PLDI 2004: 107-118 |
25 | EE | John D. Kececioglu,
Dean Starrett:
Aligning alignments exactly.
RECOMB 2004: 85-96 |
2001 |
24 | EE | John D. Kececioglu,
Jun Ju:
Separtating repeats in DNA sequence assembly.
RECOMB 2001: 176-183 |
2000 |
23 | EE | John D. Kececioglu,
Sanjay Shete,
Jonathan Arnold:
Reconstructing distances in physical maps of chromosomes with nonoverlapping probes.
RECOMB 2000: 183-192 |
22 | | John D. Kececioglu,
Hans-Peter Lenhof,
Kurt Mehlhorn,
Petra Mutzel,
Knut Reinert,
Martin Vingron:
A polyhedral approach to sequence alignment problems.
Discrete Applied Mathematics 104(1-3): 143-186 (2000) |
1999 |
21 | EE | Thomas Christof,
John D. Kececioglu:
Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut.
RECOMB 1999: 115-123 |
1998 |
20 | | John D. Kececioglu,
A. Justin Pecqueur:
Computing Maximum-Cardinality Matchings in Sparse General Graphs.
Algorithm Engineering 1998: 121-132 |
19 | | John D. Kececioglu,
Weiqing Zhang:
Aligning Alignments.
CPM 1998: 189-208 |
18 | EE | John D. Kececioglu,
Dan Gusfield:
Reconstructing a History of Recombinations From a Set of Sequences.
Discrete Applied Mathematics 88(1-3): 239-260 (1998) |
17 | EE | R. Ravi,
John D. Kececioglu:
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.
Discrete Applied Mathematics 88(1-3): 355-366 (1998) |
1997 |
16 | EE | Knut Reinert,
Hans-Peter Lenhof,
Petra Mutzel,
Kurt Mehlhorn,
John D. Kececioglu:
A branch-and-cut algorithm for multiple sequence alignment.
RECOMB 1997: 241-250 |
15 | EE | Thomas Christof,
Michael Jünger,
John D. Kececioglu,
Petra Mutzel,
Gerhard Reinelt:
A branch-and-cut approach to physical mapping with end-probes.
RECOMB 1997: 84-92 |
14 | | Thomas Christof,
Michael Jünger,
John D. Kececioglu,
Petra Mutzel,
Gerhard Reinelt:
A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes.
Journal of Computational Biology 4(4): 433-448 (1997) |
13 | EE | John D. Kececioglu,
Ming Li,
John Tromp:
Inferring a DNA Sequence from Erroneous Copies.
Theor. Comput. Sci. 185(1): 3-13 (1997) |
1996 |
12 | | David Sankoff,
Gopal Sundaram,
John D. Kececioglu:
Steiner Points in the Space of Genome Rearrangements.
Int. J. Found. Comput. Sci. 7(1): 1-9 (1996) |
1995 |
11 | | John D. Kececioglu,
Ming Li,
John Tromp:
Inferring a DNA Sequence from Erroneous Copies (Abstract).
ALT 1995: 151-152 |
10 | | Sandeep K. Gupta,
John D. Kececioglu,
Alejandro A. Schäffer:
Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practice (Extended Abstract).
CPM 1995: 128-143 |
9 | | R. Ravi,
John D. Kececioglu:
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.
CPM 1995: 330-339 |
8 | | John D. Kececioglu,
R. Ravi:
Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation.
SODA 1995: 604-613 |
7 | | John D. Kececioglu,
David Sankoff:
Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement.
Algorithmica 13(1/2): 180-210 (1995) |
6 | | John D. Kececioglu,
Eugene W. Myers:
Combinatiorial Algorithms for DNA Sequence Assembly.
Algorithmica 13(1/2): 7-51 (1995) |
5 | | Sandeep K. Gupta,
John D. Kececioglu,
Alejandro A. Schäffer:
Improving the Practical Space and Time Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment.
Journal of Computational Biology 2(3): 459-472 (1995) |
1994 |
4 | | John D. Kececioglu,
David Sankoff:
Efficient Bounds for Oriented Chromosome Inversion Distance.
CPM 1994: 307-325 |
3 | | John D. Kececioglu,
Dan Gusfield:
Reconstructing a History of Recombinations from a Set of Sequences.
SODA 1994: 471-480 |
1993 |
2 | | John D. Kececioglu:
The Maximum Weight Trace Problem in Multiple Sequence Alignment.
CPM 1993: 106-119 |
1 | | John D. Kececioglu,
David Sankoff:
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes.
CPM 1993: 87-105 |