Martin Tompa

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Meta-analysis of Inter-species Liver Co-expression Networks Elucidates Traits Associated with Common Human Diseases.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2009

Algorithms for locating extremely conserved elements in multiple sequence alignments.

[BibT_eX]

[DOI]

Huei-Hun Elizabeth Tseng

BMC Bioinform., 2009

2007

A Computational Pipeline for High- Throughput Discovery of <i>cis</i>-Regulatory Noncoding RNA in Prokaryotes.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2007

How accurately is ncRNA aligned within whole-genome multiple alignments?

[BibT_eX]

[DOI]

Adrienne X. Wang

BMC Bioinform., 2007

2006

MicroFootPrinter: a tool for phylogenetic footprinting in prokaryotic genomes.

[BibT_eX]

[DOI]

Shane J. Neph

Nucleic Acids Res., 2006

Analysis of computational approaches for motif discovery.

[BibT_eX]

[DOI]

Nan Li

Algorithms Mol. Biol., 2006

2005

Statistics of local multiple alignments.

[BibT_eX]

[DOI]

Amol Prakash

Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

2004

PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences.

[BibT_eX]

[DOI]

BMC Bioinform., 2004

Motif Discovery in Heterogeneous Sequence Data.

[BibT_eX]

[DOI]

Proceedings of the Biocomputing 2004, 2004

2003

YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2003

FootPrinter: a program designed for phylogenetic footprinting.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2003

Performance Comparison of Algorithms for FindingTranscription Factor Binding Sites.

[BibT_eX]

[DOI]

Proceedings of the 3rd IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2003), 2003

An Empirical Comparison of Tools for Phylogenetic Footprinting.

[BibT_eX]

[DOI]

Samson Kwong

Proceedings of the 3rd IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2003), 2003

2002

Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach.

[BibT_eX]

[DOI]

Rimli Sengupta

J. Comput. Biol., 2002

Finding Motifs Using Random Projections.

[BibT_eX]

[DOI]

Jeremy Buhler

J. Comput. Biol., 2002

Algorithms for Phylogenetic Footprinting.

[BibT_eX]

[DOI]

Benno Schwikowski

J. Comput. Biol., 2002

Construction of optimal quality control for oligo arrays.

[BibT_eX]

[DOI]

Charles J. Colbourn

Alan C. H. Ling

Bioinform., 2002

2001

Equireplicate Balanced Binary Codes for Oligo Arrays.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

2000

A Statistical Method for Finding Transcription Factor Binding Sites.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

An Exact Algorithm to Identify Motifs in Orthologous Sequences from Multiple Species.

[BibT_eX]

[DOI]

Benno Schwikowski

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

1999

A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

An Exact Method for Finding Short Motifs in Sequences, with Application to the Ribosome Binding Site Problem.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, 1999

A Linear Time Algorithm for Finding All Maximal Scoring Subsequences.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, 1999

1998

An algorithm for finding novel gapped motifs in DNA sequences.

[BibT_eX]

[DOI]

Emily Rocke

Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

1996

Minimal Adaptive Routing on the Mesh with Bounded Queue Size.

[BibT_eX]

[DOI]

Donald D. Chinn

Frank Thomson Leighton

J. Parallel Distributed Comput., 1996

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata.

[BibT_eX]

[DOI]

Inf. Comput., 1996

1995

Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five

[BibT_eX]

[DOI]

Jonathan F. Buss

Inf. Comput., August, 1995

1994

Communication-Space Tradeoffs for Unrestricted Protocols.

[BibT_eX]

[DOI]

Paul Beame

Peiyuan Yan

SIAM J. Comput., 1994

A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth.

[BibT_eX]

[DOI]

Prasoon Tiwari

Inf. Process. Lett., 1994

1992

Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Trade-Offs between Communication and Space.

[BibT_eX]

[DOI]

Tak Wah Lam

Prasoon Tiwari

J. Comput. Syst. Sci., 1992

Lower Bounds on the Length of Universal Traversal Sequences.

[BibT_eX]

[DOI]

Allan Borodin

J. Comput. Syst. Sci., 1992

1990

Figures of merit: the sequel.

[BibT_eX]

[DOI]

SIGACT News, 1990

The complexity of short two-person games.

[BibT_eX]

[DOI]

Ashok K. Chandra

Discret. Appl. Math., 1990

Time-Space Tradeoffs for Undirected Graph Traversal

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Parallel Graph Algorithms That Are Efficient on Average

[BibT_eX]

[DOI]

Don Coppersmith

Prabhakar Raghavan

Inf. Comput., June, 1989

Figures of merit.

[BibT_eX]

[DOI]

SIGACT News, 1989

A New Pebble Game That Characterizes Parallel Complexity Classes.

[BibT_eX]

[DOI]

H. Venkateswaran

SIAM J. Comput., 1989

Erratum: Two Applications of Inductive Counting for Complementation Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Two Applications of Inductive Counting for Complementation Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Tradeoffs Between Communication and Space

[BibT_eX]

[DOI]

Tak Wah Lam

Prasoon Tiwari

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract)

[BibT_eX]

[DOI]

Allan Borodin

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

How to Share a Secret with Cheaters.

[BibT_eX]

[DOI]

Heather Woll

J. Cryptol., 1988

The parallel complexity of exponentiating polynomials over finite fields.

[BibT_eX]

[DOI]

Faith E. Fich

J. ACM, 1988

Zero Knowledge Interactive Proofs of Knowledge (A Digest).

[BibT_eX]

Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, 1988

Two applications of complementation via inductive counting.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987

Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information

[BibT_eX]

[DOI]

Heather Woll

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985

The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees

[BibT_eX]

[DOI]

Udi Manber

J. ACM, July, 1985

Decreasing the Nesting Depth of Expressions Involving Square Roots.

[BibT_eX]

[DOI]

J. Symb. Comput., 1985

Speedups of Deterministic Machines by Synchronous Parallel Machines.

[BibT_eX]

[DOI]

Patrick W. Dymond

J. Comput. Syst. Sci., 1985

1984

The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem.

[BibT_eX]

[DOI]

Udi Manber

SIAM J. Comput., 1984

Space-Bounded Hierarchies and Probabilistic Computations.

[BibT_eX]

[DOI]

Janos Simon

J. Comput. Syst. Sci., 1984

1982

Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

Probabilistic, Nondeterministic, and Alternating Decision Trees

[BibT_eX]

[DOI]

Udi Manber

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1981

An Optimal Solution to a Wire-Routing Problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits.

[BibT_eX]

J. Comput. Syst. Sci., 1981

A Time-Space Tradeoff for Sorting on Non-Oblivious Machines.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

An Extension of Savitch's Theorem to Small Space Bounds.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1980

Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

An Optimal Solution to a Wire-Routing Problem (Preliminary Version)

[BibT_eX]

[DOI]