Walter L. Ruzzo

According to our database1, Walter L. Ruzzo
  • authored at least 60 papers between 1975 and 2014.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2014
Discriminative motif analysis of high-throughput dataset.
Bioinformatics, 2014

2013
Accelerating ncRNA homology search with FPGAs.
Proceedings of the 2013 ACM/SIGDA International Symposium on Field Programmable Gate Arrays, 2013

2012
Integration of 198 ChIP-seq Datasets Reveals Human cis-Regulatory Regions.
Journal of Computational Biology, 2012

Compression of next-generation sequencing reads aided by highly efficient de novo assembly
CoRR, 2012

A new approach to bias correction in RNA-Seq.
Bioinformatics, 2012

Hardware Acceleration of Short Read Mapping.
Proceedings of the 2012 IEEE 20th Annual International Symposium on Field-Programmable Custom Computing Machines, 2012

2009
Finding Non-Coding RNAs through genome-Scale Clustering.
J. Bioinformatics and Computational Biology, 2009

Multiperm: shuffling multiple sequence alignments while approximately preserving dinucleotide frequencies.
Bioinformatics, 2009

2008
Finding Non-coding RNAs Through Genome-Scale Clustering.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007
A Computational Pipeline for High- Throughput Discovery of cis-Regulatory Noncoding RNA in Prokaryotes.
PLoS Computational Biology, 2007

How accurately is ncRNA aligned within whole-genome multiple alignments?
BMC Bioinformatics, 2007

2006
A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data.
BMC Bioinformatics, 2006

CMfinder - a covariance model based RNA motif finding algorithm.
Bioinformatics, 2006

Sequence-based heuristics for faster annotation of non-coding RNA families.
Bioinformatics, 2006

2005
Searching for Non-coding RNA.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2005

2004
Faster genome annotation of non-coding RNA families without loss of accuracy.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy.
Proceedings of the Proceedings Twelfth International Conference on Intelligent Systems for Molecular Biology/Third European Conference on Computational Biology 2004, 2004

2003
Improved Gene Selection for Classification of Microarrays.
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

2002
Pre-mRNA Secondary Structure Prediction Aids Splice Site Prediction.
Proceedings of the 7th Pacific Symposium on Biocomputing, 2002

2001
Principal component analysis for clustering gene expression data.
Bioinformatics, 2001

Validating clustering for gene expression data.
Bioinformatics, 2001

Model-based clustering and data transformations for gene expression data.
Bioinformatics, 2001

2000
Parallel RAMs with owned global memory and deterministic context-free language recognition.
J. ACM, 2000

Algorithms for a Simple Point Placement Problem.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata.
SIAM J. Comput., 1999

A Linear Time Algorithm for Finding All Maximal Scoring Subsequences.
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, 1999

1998
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity.
SIAM J. Comput., 1998

1997
The Electrical Resistance of a Graph Captures its Commute and Cover Times.
Computational Complexity, 1997

Undirected s-t Connectivity in Polynomial Time and Sublinear Space.
Computational Complexity, 1997

1996
Pointers versus Arithmetic in PRAMs.
J. Comput. Syst. Sci., 1996

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata.
Inf. Comput., 1996

1993
Pointers versus Arithmetic in PRAMs.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
Results on Communication Complexity Classes.
J. Comput. Syst. Sci., 1992

Lower Bounds on the Length of Universal Traversal Sequences.
J. Comput. Syst. Sci., 1992

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991
Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1990
Low Overhead Parallel Schedules for Task Graphs.
SPAA, 1990

Time-Space Tradeoffs for Undirected Graph Traversal
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
The Iterated Mod Problem
Inf. Comput., March, 1989

Erratum: Two Applications of Inductive Counting for Complementation Problems.
SIAM J. Comput., 1989

Two Applications of Inductive Counting for Complementation Problems.
SIAM J. Comput., 1989

The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

The Power of Parallel Pointer Manipulation.
SPAA, 1989

Results on Communication Complexity Classes.
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
Two applications of complementation via inductive counting.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1986
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984
Space-Bounded Hierarchies and Probabilistic Computations.
J. Comput. Syst. Sci., 1984

1982
Space-Bounded Hierarchies and Probabilistic Computations
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1981
On Uniform Circuit Complexity.
J. Comput. Syst. Sci., 1981

Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract)
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980
An Improved Context-Free Recognizer.
ACM Trans. Program. Lang. Syst., 1980

Tree-Size Bounded Alternation.
J. Comput. Syst. Sci., 1980

1979
Tree-Size Bounded Alternation
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract).
Proceedings of the Automata, 1979

On Uniform Circuit Complexity (Extended Abstract)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Improved Time and Space Bounds for Boolean Matrix Multiplication.
Acta Inf., 1978

1976
Protection in Operating Systems.
Commun. ACM, 1976

On Line Context Free Language Recognition in Less than Cubic Time (Extended Abstract)
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975
On Protection in Operating System.
Proceedings of the Fifth Symposium on Operating System Principles, 1975


  Loading...