866 search results - page 3 / 174 » Algorithms for Comparing Pedigree Graphs |
JETAI
2002
13 years 7 months ago
2002
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
DM
1999
13 years 7 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
AAIM
2008
Springer
14 years 2 months ago
2008
Springer
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...