# Martin Tompa

Affiliations:- University of Washington, Seattle, Washington, USA

According to our database

Collaborative distances:

^{1}, Martin Tompa authored at least 62 papers between 1979 and 2009.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2009

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

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

PLoS Comput. Biol., 2009

Algorithms for locating extremely conserved elements in multiple sequence alignments.

BMC Bioinform., 2009

2007

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

PLoS Comput. Biol., 2007

BMC Bioinform., 2007

2006

Nucleic Acids Res., 2006

Algorithms Mol. Biol., 2006

2005

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.

BMC Bioinform., 2004

Proceedings of the Biocomputing 2004, 2004

2003

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

Nucleic Acids Res., 2003

Nucleic Acids Res., 2003

Performance Comparison of Algorithms for FindingTranscription Factor Binding Sites.

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

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

2002

J. Comput. Biol., 2002

J. Comput. Biol., 2002

J. Comput. Biol., 2002

Bioinform., 2002

2001

SIAM J. Discret. Math., 2001

2000

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.

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

1999

SIAM J. Comput., 1999

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

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

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

1998

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

1996

J. Parallel Distributed Comput., 1996

Inf. Comput., 1996

1995

Inf. Comput., August, 1995

1994

SIAM J. Comput., 1994

Inf. Process. Lett., 1994

1992

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

SIAM J. Comput., 1992

J. Comput. Syst. Sci., 1992

J. Comput. Syst. Sci., 1992

1990

SIGACT News, 1990

Discret. Appl. Math., 1990

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

1989

Inf. Comput., June, 1989

SIGACT News, 1989

SIAM J. Comput., 1989

SIAM J. Comput., 1989

SIAM J. Comput., 1989

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

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

1988

J. Cryptol., 1988

J. ACM, 1988

Zero Knowledge Interactive Proofs of Knowledge (A Digest).

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

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

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

1985

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

J. ACM, July, 1985

J. Symb. Comput., 1985

J. Comput. Syst. Sci., 1985

1984

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

SIAM J. Comput., 1984

J. Comput. Syst. Sci., 1984

1982

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

SIAM J. Comput., 1982

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

1981

J. Comput. Syst. Sci., 1981

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

J. Comput. Syst. Sci., 1981

J. Comput. Syst. Sci., 1981

Inf. Process. Lett., 1981

1980

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

J. Comput. Syst. Sci., 1980

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

SIGACT News, 1979