Search the dblp DataBase
John D. Kececioglu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- John D. Kececioglu, Ming Li, John Tromp
Inferring a DNA Sequence from Erroneous Copies (Abstract). [Citation Graph (0, 0)][DBLP]
ALT, 1995, pp:151-152 [Conf] - John D. Kececioglu, David Sankoff
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes. [Citation Graph (0, 0)][DBLP]
CPM, 1993, pp:87-105 [Conf] - John D. Kececioglu, David Sankoff
Efficient Bounds for Oriented Chromosome Inversion Distance. [Citation Graph (0, 0)][DBLP]
CPM, 1994, pp:307-325 [Conf] - John D. Kececioglu, Weiqing Zhang
Aligning Alignments. [Citation Graph (0, 0)][DBLP]
CPM, 1998, pp:189-208 [Conf] - 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). [Citation Graph (0, 0)][DBLP]
CPM, 1995, pp:128-143 [Conf] - John D. Kececioglu
The Maximum Weight Trace Problem in Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP]
CPM, 1993, pp:106-119 [Conf] - R. Ravi, John D. Kececioglu
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. [Citation Graph (0, 0)][DBLP]
CPM, 1995, pp:330-339 [Conf] - Christian S. Collberg, Edward Carter, Saumya K. Debray, Andrew Huntwork, John D. Kececioglu, Cullen Linn, Michael Stepp
Dynamic path-based software watermarking. [Citation Graph (0, 0)][DBLP]
PLDI, 2004, pp:107-118 [Conf] - Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt
A branch-and-cut approach to physical mapping with end-probes. [Citation Graph (0, 0)][DBLP]
RECOMB, 1997, pp:84-92 [Conf] - Thomas Christof, John D. Kececioglu
Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut. [Citation Graph (0, 0)][DBLP]
RECOMB, 1999, pp:115-123 [Conf] - John D. Kececioglu, Jun Ju
Separtating repeats in DNA sequence assembly. [Citation Graph (0, 0)][DBLP]
RECOMB, 2001, pp:176-183 [Conf] - John D. Kececioglu, Eagu Kim
Simple and Fast Inverse Alignment. [Citation Graph (0, 0)][DBLP]
RECOMB, 2006, pp:441-455 [Conf] - John D. Kececioglu, Dean Starrett
Aligning alignments exactly. [Citation Graph (0, 0)][DBLP]
RECOMB, 2004, pp:85-96 [Conf] - John D. Kececioglu, Sanjay Shete, Jonathan Arnold
Reconstructing distances in physical maps of chromosomes with nonoverlapping probes. [Citation Graph (0, 0)][DBLP]
RECOMB, 2000, pp:183-192 [Conf] - Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu
A branch-and-cut algorithm for multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
RECOMB, 1997, pp:241-250 [Conf] - John D. Kececioglu, Dan Gusfield
Reconstructing a History of Recombinations from a Set of Sequences. [Citation Graph (0, 0)][DBLP]
SODA, 1994, pp:471-480 [Conf] - John D. Kececioglu, R. Ravi
Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. [Citation Graph (0, 0)][DBLP]
SODA, 1995, pp:604-613 [Conf] - John D. Kececioglu, A. Justin Pecqueur
Computing Maximum-Cardinality Matchings in Sparse General Graphs. [Citation Graph (0, 0)][DBLP]
Algorithm Engineering, 1998, pp:121-132 [Conf] - John D. Kececioglu, Eugene W. Myers
Combinatiorial Algorithms for DNA Sequence Assembly. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1995, v:13, n:1/2, pp:7-51 [Journal] - John D. Kececioglu, David Sankoff
Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1995, v:13, n:1/2, pp:180-210 [Journal] - John D. Kececioglu, Dan Gusfield
Reconstructing a History of Recombinations From a Set of Sequences. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:239-260 [Journal] - John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron
A polyhedral approach to sequence alignment problems. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:143-186 [Journal] - R. Ravi, John D. Kececioglu
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:355-366 [Journal] - David Sankoff, Gopal Sundaram, John D. Kececioglu
Steiner Points in the Space of Genome Rearrangements. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 1996, v:7, n:1, pp:1-9 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
Journal of Computational Biology, 1997, v:4, n:4, pp:433-448 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
Journal of Computational Biology, 1995, v:2, n:3, pp:459-472 [Journal] - John D. Kececioglu, Ming Li, John Tromp
Inferring a DNA Sequence from Erroneous Copies. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1997, v:185, n:1, pp:3-13 [Journal] - Eagu Kim, John D. Kececioglu
Inverse Sequence Alignment from Partial Examples. [Citation Graph (0, 0)][DBLP]
WABI, 2007, pp:359-370 [Conf]
Multiple alignment by aligning alignments. [Citation Graph (, )][DBLP]
Learning Models for Aligning Protein Sequences with Predicted Secondary Structure. [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002