4137 search results - page 77 / 828 » On the number of matchings of a tree |
117
click to vote
DL
2000
Springer
15 years 6 months ago
2000
Springer
In this paper we introduce the MatchDetectReveal(MDR) system, which is capable of identifying overlapping and plagiarised documents. Each component of the system is briefly descri...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
139
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Regions of interest identified through genetic linkage studies regularly exceed 30 centimorgans in size and can contain hundreds of genes. Traditionally this number is...
124
click to vote
RECOMB
2009
Springer
16 years 2 months ago
2009
Springer
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
101
click to vote
PKDD
2007
Springer
15 years 8 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...