Helman, Paul
Overview
Works: | 31 works in 108 publications in 1 language and 1,053 library holdings |
---|---|
Genres: | Academic theses |
Roles: | Author |
Classifications: | QA76.73.C153, 005.73 |
Publication Timeline
.
Most widely held works by
Paul Helman
Intermediate problem solving and data structures : walls and mirrors by
Paul Helman(
Book
)
22 editions published between 1985 and 1991 in English and held by 468 WorldCat member libraries worldwide
22 editions published between 1985 and 1991 in English and held by 468 WorldCat member libraries worldwide
Data abstraction and problem solving with C++ : walls and mirrors by
Frank M Carrano(
Book
)
12 editions published between 1997 and 1998 in English and held by 169 WorldCat member libraries worldwide
"Focusing on data abstraction and data structures, the second edition of this very successful book continues to emphasize the needs of both the instructor and the student. The book illustrates the role of classes and abstract data types (ADTs) in the problem-solving process as the foundation for an object-oriented approach. Throughout the next, the distinction between specification and implementation is continually stressed. The text covers major applications of ADTs, such as searching a flight map and performing an event-driven simulation. It also offers early, extensive coverage of recursion and uses this technique in many examples and exercises. Overall, the lucid writing style, widespread use of examples, and flexible coverage of material have helped make this a leading book in the field."--Jacket
12 editions published between 1997 and 1998 in English and held by 169 WorldCat member libraries worldwide
"Focusing on data abstraction and data structures, the second edition of this very successful book continues to emphasize the needs of both the instructor and the student. The book illustrates the role of classes and abstract data types (ADTs) in the problem-solving process as the foundation for an object-oriented approach. Throughout the next, the distinction between specification and implementation is continually stressed. The text covers major applications of ADTs, such as searching a flight map and performing an event-driven simulation. It also offers early, extensive coverage of recursion and uses this technique in many examples and exercises. Overall, the lucid writing style, widespread use of examples, and flexible coverage of material have helped make this a leading book in the field."--Jacket
The science of database management by
Paul Helman(
Book
)
8 editions published in 1994 in English and Undetermined and held by 156 WorldCat member libraries worldwide
8 editions published in 1994 in English and Undetermined and held by 156 WorldCat member libraries worldwide
Data structures and problem solving with Turbo Pascal : walls and mirrors by
Frank M Carrano(
Book
)
12 editions published between 1992 and 1993 in English and held by 108 WorldCat member libraries worldwide
12 editions published between 1992 and 1993 in English and held by 108 WorldCat member libraries worldwide
Walls and mirrors : intermediate problem solving and data structures by
Paul Helman(
Book
)
11 editions published in 1988 in English and held by 104 WorldCat member libraries worldwide
Software -- Programming Techniques
11 editions published in 1988 in English and held by 104 WorldCat member libraries worldwide
Software -- Programming Techniques
Application of multidisciplinary analysis to gene expression(
)
1 edition published in 2004 in English and held by 6 WorldCat member libraries worldwide
Molecular analysis of cancer, at the genomic level, could lead to individualized patient diagnostics and treatments. The developments to follow will signal a significant paradigm shift in the clinical management of human cancer. Despite our initial hopes, however, it seems that simple analysis of microarray data cannot elucidate clinically significant gene functions and mechanisms. Extracting biological information from microarray data requires a complicated path involving multidisciplinary teams of biomedical researchers, computer scientists, mathematicians, statisticians, and computational linguists. The integration of the diverse outputs of each team is the limiting factor in the progress to discover candidate genes and pathways associated with the molecular biology of cancer. Specifically, one must deal with sets of significant genes identified by each method and extract whatever useful information may be found by comparing these different gene lists. Here we present our experience with such comparisons, and share methods developed in the analysis of an infant leukemia cohort studied on Affymetrix HG-U95A arrays. In particular, spatial gene clustering, hyper-dimensional projections, and computational linguistics were used to compare different gene lists. In spatial gene clustering, different gene lists are grouped together and visualized on a three-dimensional expression map, where genes with similar expressions are co-located. In another approach, projections from gene expression space onto a sphere clarify how groups of genes can jointly have more predictive power than groups of individually selected genes. Finally, online literature is automatically rearranged to present information about genes common to multiple groups, or to contrast the differences between the lists. The combination of these methods has improved our understanding of infant leukemia. While the complicated reality of the biology dashed our initial, optimistic hopes for simple answers from microarrays, we have made progress by combining very different analytic approaches
1 edition published in 2004 in English and held by 6 WorldCat member libraries worldwide
Molecular analysis of cancer, at the genomic level, could lead to individualized patient diagnostics and treatments. The developments to follow will signal a significant paradigm shift in the clinical management of human cancer. Despite our initial hopes, however, it seems that simple analysis of microarray data cannot elucidate clinically significant gene functions and mechanisms. Extracting biological information from microarray data requires a complicated path involving multidisciplinary teams of biomedical researchers, computer scientists, mathematicians, statisticians, and computational linguists. The integration of the diverse outputs of each team is the limiting factor in the progress to discover candidate genes and pathways associated with the molecular biology of cancer. Specifically, one must deal with sets of significant genes identified by each method and extract whatever useful information may be found by comparing these different gene lists. Here we present our experience with such comparisons, and share methods developed in the analysis of an infant leukemia cohort studied on Affymetrix HG-U95A arrays. In particular, spatial gene clustering, hyper-dimensional projections, and computational linguistics were used to compare different gene lists. In spatial gene clustering, different gene lists are grouped together and visualized on a three-dimensional expression map, where genes with similar expressions are co-located. In another approach, projections from gene expression space onto a sphere clarify how groups of genes can jointly have more predictive power than groups of individually selected genes. Finally, online literature is automatically rearranged to present information about genes common to multiple groups, or to contrast the differences between the lists. The combination of these methods has improved our understanding of infant leukemia. While the complicated reality of the biology dashed our initial, optimistic hopes for simple answers from microarrays, we have made progress by combining very different analytic approaches
A new theory of dynamic programming by
Paul Helman(
Book
)
6 editions published between 1982 and 1984 in English and held by 5 WorldCat member libraries worldwide
We develop a formal model of enumeration problems and define dynamic programming in its setting. Dynamic programming is then proved to be an optimally efficient class of algorithms
6 editions published between 1982 and 1984 in English and held by 5 WorldCat member libraries worldwide
We develop a formal model of enumeration problems and define dynamic programming in its setting. Dynamic programming is then proved to be an optimally efficient class of algorithms
A common schema for dynamic programming and branch and bound type algorithms by
Paul Helman(
Book
)
3 editions published between 1986 and 1988 in English and held by 4 WorldCat member libraries worldwide
3 editions published between 1986 and 1988 in English and held by 4 WorldCat member libraries worldwide
Intermediate problem solving and data structures : walls and mirrors by
Kristen Jensen(
Book
)
2 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide
Designing deductive databases by
Paul Helman(
Book
)
2 editions published in 1986 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1986 in English and held by 3 WorldCat member libraries worldwide
Walls and mirrors Modula II by
Paul Helman(
Book
)
1 edition published in 1988 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1988 in English and held by 2 WorldCat member libraries worldwide
Understanding and extending transformation-based optimizers by
Arnon Seth Rosenthal(
Book
)
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
The principle of optimality in the design of efficient algorithms by
Paul Helman(
Book
)
2 editions published in 1985 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1985 in English and held by 2 WorldCat member libraries worldwide
A theory of greedy structures based on K-ary dominance relations by
Paul Helman(
Book
)
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
Deductive datbase design in the presence of updates by
Paul Helman(
Book
)
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
A fast, optimal data allocation algorithm with sensitivity analysis by
Paul Helman(
Book
)
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
Mass production of query optimization: towards faster multiple query optimization and database design by
Paul Helman(
Book
)
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
An algebra for search problems and their solutions by
Paul Helman(
Book
)
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
An NP-complete data aggregation problem by
Paul Helman(
Book
)
2 editions published in 1984 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1984 in English and held by 2 WorldCat member libraries worldwide
Heuristics for designing database record to minimize retrieval times by Thomas H Meyer(
Book
)
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
more

fewer

Audience Level
0 |
![]() |
1 | ||
Kids | General | Special |

Associated Subjects
Abstract data types (Computer science) Algorithms Branch and bound algorithms C++ (Computer program language) Combinatorial enumeration problems Combinatorial optimization Completeness theorem Computational complexity Computer programming Computer programs--Verification Database design Database management Data structures (Computer science) Deductive databases Directed graphs Dynamic programming Dynamic storage allocation (Computer science) Electronic data processing--Distributed processing Greedoids Heuristic programming Modula-2 (Computer program language) Nonassociative algebras NP-complete problems Pascal (Computer program language) Problem solving Problem solving--Data processing Relational databases Set functions Storage fragmentation (Computer science) System design Turbo Pascal (Computer file)