Results 1  10
of
583,463
Core and Conditional Core Path of Specified Length in Special Classes of Graphs
"... Abstract. A core path of a graph is a path P in G that minimizes d(P) d(v, P)w(v). In this paper, we study the location of core path v∈V of specified length in special classes of graphs. Further, we extend our study to the problem of locating a core path of specified length under the condition that ..."
Abstract
 Add to MetaCart
Abstract. A core path of a graph is a path P in G that minimizes d(P) d(v, P)w(v). In this paper, we study the location of core path v∈V of specified length in special classes of graphs. Further, we extend our study to the problem of locating a core path of specified length under the condition
Construction of genetic linkage map in man using restriction fragment length polymorphisom
 Am. J. Hum Genet
"... We describe a new basis for the construction of a genetic linkage map of the human genome. The basic principle of the mapping scheme is to develop, by recombinant DNA techniques, random singlecopy DNA probes capable of detecting DNA sequence polymorphisms, when hybridized to restriction digests of ..."
Abstract

Cited by 456 (1 self)
 Add to MetaCart
requiring direct access to a specified gene's DNA. For inherited diseases mapped in this way, linked DNA marker loci can be used predictively for genetic counseling.
Efficient similarity search in sequence databases
, 1994
"... We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Anot ..."
Abstract

Cited by 515 (19 self)
 Add to MetaCart
. Another important observation is Parseval's theorem, which specifies that the Fourier transform preserves the Euclidean distance in the time or frequency domain. Having thus mapped sequences to a lowerdimensionality space by using only the first few Fourier coe cients, we use Rtrees to index
The sources and consequences of embeddedness for the economic performance of organizations: The network effect
 American Sociological Review
, 1996
"... In this paper, I attempt to advance the concept of embeddedness beyond the level of a programmatic statement by developing a formulation that specifies how embeddedness and network structure affect economic action. On the basis of existing theory and original ethnographies of 23 apparel firms, I dev ..."
Abstract

Cited by 744 (8 self)
 Add to MetaCart
In this paper, I attempt to advance the concept of embeddedness beyond the level of a programmatic statement by developing a formulation that specifies how embeddedness and network structure affect economic action. On the basis of existing theory and original ethnographies of 23 apparel firms, I
Fast subsequence matching in timeseries databases
 PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1994
"... We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract

Cited by 533 (24 self)
 Add to MetaCart
We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 783 (29 self)
 Add to MetaCart
Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We
Paths of specified length in a random kpartite graph
, 2000
"... Fix positive integers k and l. Consider a random kpartite graph on n vertices obtained by partitioning the vertex set into Vi,(i = 1,...,k) each having size Ω(n) and choosing each possible edge with probability p. Consider any vertex x in any Vi and any vertex y. We show that the expected number of ..."
Abstract
 Add to MetaCart
of simple paths of even length l between x and y differ significantly depending on whether y belongs to the same Vi (as x does) or not. A similar phenomenon occurs when l is odd. This result holds even when k,l vary slowly with n. This fact has implications to coloring random graphs. The proof is based
The embryonic cell lineage of the nematode Caenorhabditis elegans
 Dev. Biol
, 1983
"... The number of nongonadal nuclei in the freeliving soil nematode Caenorhabditis elegans increases from about 550 in the newly hatched larva to about 810 in the mature hermaphrodite and to about 970 in the mature male. The pattern of cell divisions which leads to this increase is essentially invarian ..."
Abstract

Cited by 540 (19 self)
 Add to MetaCart
invariant among individuals; rigidly determined cell lineages generate a fixed number of progeny cells of strictly specified fates. These lineages range in length from one to eight sequential divisions and lead to significant developmental changes in the neuronal, muscular, hypodermal, and digestive systems
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
, 1998
"... including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified length, which was proved to be NPhard later in [8]. Recently, in [6,7], Peng and Lo have proposed efficient parallel a ..."
Abstract
 Add to MetaCart
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified length, which was proved to be NPhard later in [8]. Recently, in [6,7], Peng and Lo have proposed efficient parallel
Results 1  10
of
583,463