#### Filter Results:

#### Publication Year

1978

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Jeremy Buhler, Martin Tompa
- RECOMB
- 2001

Pevzner and Sze [23] considered a precise version of the motif discovery problem and simultaneously issued an algorithmic challenge: find a motif <i>M</i> of length 15, where each planted instance differs from <i>M</i> in 4 positions. Whereas previous algorithms all failed to solve this (15,4)-motif problem. Pevzner and Sze introduced algorithms that… (More)

- Martin Tompa, Nan Li, +22 authors Zhou Zhu
- Nature biotechnology
- 2005

The prediction of regulatory elements is a problem where computational methods offer great hope. Over the past few years, numerous tools have become available for this task. The purpose of the current assessment is twofold: to provide some guidance to users regarding the accuracy of currently available tools in various settings, and to provide a benchmark… (More)

- Martin Tompa, Heather Woll
- CRYPTO
- 1986

- Saurabh Sinha, Mathieu Blanchette, Martin Tompa
- BMC Bioinformatics
- 2004

BACKGROUND
This paper addresses the problem of discovering transcription factor binding sites in heterogeneous sequence data, which includes regulatory sequences of one or more genes, as well as their orthologs in other species.
RESULTS
We propose an algorithm that integrates two important aspects of a motif's significance - overrepresentation and… (More)

- Walter L. Ruzzo, Martin Tompa
- ISMB
- 1999

Given a sequence of real numbers ("scores"), we present a practical linear time algorithm to find those nonoverlapping, contiguous subsequences having greatest total scores. This improves on the best previously known algorithm, which requires quadratic time in the worst case. The problem arises in biological sequence analysis, where the high-scoring… (More)

- Saurabh Sinha, Martin Tompa
- Nucleic acids research
- 2002

Understanding the complex and varied mechanisms that regulate gene expression is an important and challenging problem. A fundamental sub-problem is to identify DNA binding sites for unknown regulatory factors, given a collection of genes believed to be co-regulated. We discuss a computational method that identifies good candidates for such binding sites.… (More)

- Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
- SIAM J. Comput.
- 1989

Following the recent independent proofs of Immerman [SLAM J. nondeterministic space-bounded complexity classes are closed under complementation, two further applications of the inductive counting technique are developed. First, an errorless probabilistic algorithm for the undirected graph s-t connectivity problem that runs in O(log n) space and polynomial… (More)

- Heui-Dong Park, Kristi M Guinn, +5 authors David R Sherman
- Molecular microbiology
- 2003

Unlike many pathogens that are overtly harmful to their hosts, Mycobacterium tuberculosis can persist for years within humans in a clinically latent state. Latency is often linked to hypoxic conditions within the host. Among M. tuberculosis genes induced by hypoxia is a putative transcription factor, Rv3133c/DosR. We performed targeted disruption of this… (More)

- Mathieu Blanchette, Martin Tompa
- Nucleic Acids Research
- 2003

Phylogenetic footprinting is a method for the discovery of regulatory elements in a set of homologous regulatory regions, usually collected from multiple species. It does so by identifying the best conserved motifs in those homologous regions. This note describes web software that has been designed specifically for this purpose, making use of the… (More)

- Martin Tompa, Heather Woll
- 28th Annual Symposium on Foundations of Computer…
- 1987

The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any "random self-reducible" problem has a zero knowledge interactive proof of this sort. The zero knowledge interactive proofs for graph isomorphism, quadratic residuosity, and "knowledge" of discrete logarithms all follow as special… (More)