John D. Kececioglu

	2012
32		Dan F. DeBlasio, Travis J. Wheeler, John D. Kececioglu: Estimating the Accuracy of Multiple Alignments and its Use in Parameter Advising. RECOMB 2012: 45-59
	2009
31		Eagu Kim, Travis J. Wheeler, John D. Kececioglu: Learning Models for Aligning Protein Sequences with Predicted Secondary Structure. RECOMB 2009: 512-531
	2008
30		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		Travis J. Wheeler, John D. Kececioglu: Multiple alignment by aligning alignments. ISMB/ECCB (Supplement of Bioinformatics) 2007: 559-568
28		Eagu Kim, John D. Kececioglu: Inverse Sequence Alignment from Partial Examples. WABI 2007: 359-370
	2006
27		John D. Kececioglu, Eagu Kim: Simple and Fast Inverse Alignment. RECOMB 2006: 441-455
	2004
26		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		John D. Kececioglu, Dean Starrett: Aligning alignments exactly. RECOMB 2004: 85-96
	2001
24		John D. Kececioglu, Jun Ju: Separtating repeats in DNA sequence assembly. RECOMB 2001: 176-183
	2000
23		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		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		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		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		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		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		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

Coauthor Index

1	Jonathan Arnold	[23]
2	Edward Carter	[26]
3	Thomas Christof	[14] [15] [21]
4	Christian S. Collberg	[26]
5	Dan F. DeBlasio	[32]
6	Saumya K. Debray	[26]
7	Sandeep K. Gupta	[5] [10]
8	Dan Gusfield	[3] [18]
9	Andrew Huntwork	[26]
10	Jun Ju	[24]
11	Michael Jünger	[14] [15]
12	Eagu Kim	[27] [28] [30] [31]
13	Hans-Peter Lenhof	[16] [22]
14	Ming Li	[11] [13]
15	Cullen Linn	[26]
16	Kurt Mehlhorn	[16] [22]
17	Petra Mutzel	[14] [15] [16] [22]
18	Eugene W. Myers (Gene Myers)	[6]
19	A. Justin Pecqueur	[20]
20	R. Ravi	[8] [9] [17]
21	Gerhard Reinelt	[14] [15]
22	Knut Reinert	[16] [22]
23	David Sankoff	[1] [4] [7] [12]
24	Alejandro A. Schäffer	[5] [10]
25	Sanjay Shete	[23]
26	Dean Starrett	[25]
27	Michael Stepp	[26]
28	Gopal Sundaram	[12]
29	John Tromp	[11] [13]
30	Martin Vingron	[22]
31	Travis J. Wheeler	[29] [31] [32]
32	Weiqing Zhang	[19]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page