Sciweavers

249 search results - page 14 / 50
» Polymorphic Binding-Time Analysis
Sort
View
DMTCS
2003
99views Mathematics» more  DMTCS 2003»
13 years 8 months ago
Combinatorial Problems Arising in SNP and Haplotype Analysis
It is widely anticipated that the study of variation in the human genome will provide a means of predicting risk of a variety of complex diseases. This paper presents a number of a...
Bjarni V. Halldórsson, Vineet Bafna, Nathan...
DOCENG
2011
ACM
12 years 7 months ago
Interoperable metadata semantics with meta-metadata: a use case integrating search engines
A use case involving integrating results from search engines illustrates how the meta-metadata language facilitates interoperable metadata semantics. Formal semantics can be hard ...
Yin Qu, Andruid Kerne, Andrew M. Webb, Aaron Herst...
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 28 days ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
BMCBI
2010
113views more  BMCBI 2010»
13 years 7 months ago
ProbABEL package for genome-wide association analysis of imputed data
Background: Over the last few years, genome-wide association (GWA) studies became a tool of choice for the identification of loci associated with complex traits. Currently, impute...
Yurii S. Aulchenko, Maksim V. Struchalin, Cornelia...
ISSRE
2000
IEEE
13 years 11 months ago
Criteria for Testing Polymorphic Relationships
The emphasis in object-oriented programs is on defining abstractions that have both state and behavior. This emphasis causes a shift in focus from software units to the way softw...
Roger T. Alexander, A. Jefferson Offutt