Search results for "Trees"

showing 10 items of 312 documents

Finding k -dissimilar paths with minimum collective length

2018

Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohibitively expensive computational cost. To achieve scalability, we also define the much smaller set …

FOS: Computer and information sciencesComputer scienceDatabases (cs.DB)0102 computer and information sciences02 engineering and technology01 natural sciencesSet (abstract data type)Exact algorithmComputer Science - Databases010201 computation theory & mathematicsIterated function020204 information systemsComputer Science - Data Structures and AlgorithmsShortest path problemScalabilityPath (graph theory)0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)Pairwise comparisonPruning (decision trees)AlgorithmProceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
researchProduct

Completely independent spanning trees in some regular graphs

2014

International audience; Let k >= 2 be an integer and T-1,..., T-k be spanning trees of a graph G. If for any pair of vertices {u, v} of V(G), the paths between u and v in every T-i, 1 <= i <= k, do not contain common edges and common vertices, except the vertices u and v, then T1,... Tk are completely independent spanning trees in G. For 2k-regular graphs which are 2k-connected, such as the Cartesian product of a complete graph of order 2k-1 and a cycle, and some Cartesian products of three cycles (for k = 3), the maximum number of completely independent spanning trees contained in these graphs is determined and it turns out that this maximum is not always k. (C) 2016 Elsevier B.V. All righ…

FOS: Computer and information sciences[ MATH ] Mathematics [math]Discrete Mathematics (cs.DM)Small Depths0102 computer and information sciences02 engineering and technology[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesCombinatoricssymbols.namesakeCompletely independent spanning treeFOS: Mathematics0202 electrical engineering electronic engineering information engineeringCartesian productDiscrete Mathematics and CombinatoricsMathematics - Combinatorics[MATH]Mathematics [math]MathematicsConstructionSpanning treeSpanning treeApplied MathematicsComplete graph020206 networking & telecommunications[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Cartesian productIndependent spanning treesGraphPlanar graphPlanar Graphs010201 computation theory & mathematicssymbolsCompletely independent spanning tree.Combinatorics (math.CO)Computer Science - Discrete Mathematics
researchProduct

Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees

2017

International audience; The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by dening (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determining if there exist two (i, j)-disjoint spanning trees in a graph G is NP-comple…

FOS: Computer and information sciences[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Discrete Mathematics (cs.DM)Spanning trees[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]0102 computer and information sciences02 engineering and technologyMinimum spanning tree[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesConnected dominating setCombinatorics[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsGridMathematicsMinimum degree spanning treeDiscrete mathematics020203 distributed computingTrémaux treeSpanning treeApplied MathematicsShortest-path treeWeight-balanced tree[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Disjoint connected dominating setsIndependent spanning trees[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsReverse-delete algorithmCompletely independent spanning treesComputer Science - Discrete MathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Plaid model for microarray data: an enhancement of the pruning step

2010

Microarrays have become a standard tool for studying gene functions. For example, we can investigate if a subset of genes shows a coherent expression pattern under different conditions. The plaid model, a model-based biclustering method, can be used to incorporate the addiction structure used for the microarray experiment. In this paper we describe an enhancement for the plaid model algorithm based on the theory of the false discovery rate.

False discovery rateStructure (mathematical logic)MicroarrayMicroarray Plaid model pruning step.Microarray analysis techniquesComputer sciencefood and beveragescomputer.software_genreBiclusteringDNA microarray experimentPruning (decision trees)Data miningDNA microarraySettore SECS-S/01 - Statisticacomputer
researchProduct

Polish is quantitatively different on quartzite flakes used on different worked materials.

2020

Metrology has been successfully used in the last decade to quantify use-wear on stone tools. Such techniques have been mostly applied to fine-grained rocks (chert), while studies on coarse-grained raw materials have been relatively infrequent. In this study, confocal microscopy was employed to investigate polished surfaces on a coarse-grained lithology, quartzite. Wear originating from contact with five different worked materials were classified in a data-driven approach using machine learning. Two different classifiers, a decision tree and a support-vector machine, were used to assign the different textures to a worked material based on a selected number of parameters (Mean density of furr…

Future studiesConfocal MicroscopyDecision AnalysisLithologyRaw MaterialsAntlersBone imagingPlant Science01 natural sciencesDiagnostic RadiologyMedicine and Health Sciences0601 history and archaeologyElectron MicroscopyAnimal AnatomyMaterialsMicroscopyMultidisciplinary060102 archaeologyPlant AnatomyRadiology and ImagingQRLight Microscopy06 humanities and the artsQuartzWoodBone ImagingProcess EngineeringPhysical SciencesMedicineEngineering and TechnologyScanning Electron MicroscopyAnatomyManagement EngineeringGeologyResearch Article010506 paleontologyImaging TechniquesScienceMaterials ScienceMineralogyIndustrial ProcessesResearch and Analysis MethodsDiagnostic MedicineIndustrial Engineering0105 earth and related environmental sciencesSurface TreatmentsDecision TreesBiology and Life SciencesManufacturing ProcessesSample size determinationZoologyPloS one
researchProduct

Hybridization between mouse lemurs in an ecological transition zone in southern Madagascar

2009

Hybrid zones in ecotones can be useful model systems for the study of evolutionary processes that shape the distribution and discreteness of species. Such studies could be important for an improved understanding of the complex biogeography of Madagascar, which is renowned for its outstanding degree of small-scale endemism. Certain forest remnants in central Madagascar indicate that transitional corridors across the island could have connected microendemics in different forest types in the past. Evolutionary processes in such corridors are difficult to study because most of these corridors have disappeared due to deforestation in central Madagascar. We studied a hybrid zone in one of the few…

Gene FlowMaleMicrocebus murinusGenetic SpeciationClimatePopulation DynamicsLemurDNA MitochondrialTreesHybrid zoneSpecies Specificitybiology.animalparasitic diseasesMadagascarGeneticsAnimalsEndemismEcosystemEcology Evolution Behavior and SystematicsbiologyEcologyGenetic VariationEcotonebiology.organism_classificationAridificationHybridization GeneticBiological dispersalFemaleCheirogaleidaeMicrocebus griseorufusMicrosatellite RepeatsMolecular Ecology
researchProduct

The pruning-grafting lattice of binary trees

2008

AbstractWe introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n−(n+1) (resp. (n−1)2) and that the number of coverings is (2nn−1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.

General Computer ScienceMatching (graph theory)Distribution sequences0102 computer and information sciencesFeasible sequences01 natural sciencesTheoretical Computer ScienceCombinatoricsCatalan numbersymbols.namesakeLattice (order)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsBinary tree010102 general mathematicsEulerian pathLatticesJoin (topology)Binary trees010201 computation theory & mathematicsShortest path problemPath (graph theory)symbolsCatalan numbersComputer Science(all)
researchProduct

Clonal population structure of the chestnut blight fungus in expanding ranges in southeastern Europe.

2008

Expanding populations are often less genetically diverse at their margins than at the centre of a species' range. Established, older populations of the chestnut blight fungus, Cryphonectria parasitica, are more variable for vegetative compatibility (vc) types than in expanding populations in southeastern Europe where C. parasitica has colonized relatively recently. To test whether vc types represent clones, we genotyped 373 isolates of C. parasitica from southern Italy, Romania, Bulgaria, Macedonia, Greece and Turkey using 11 sequence-characterized amplified region (SCAR) markers. Ten SCAR loci and six vegetative incompatibility (vic) loci were polymorphic in these samples. These population…

Genetic MarkersMating typeLinkage disequilibriumPopulationZoologyLinkage DisequilibriumTreesAscomycotaChestnut blightBotanyGenetic variationGeneticsCryphonectriaeducationDNA FungalEcology Evolution Behavior and SystematicsPlant Diseaseseducation.field_of_studybiologyfungiHaplotypeGenetic VariationHippocastanaceaebiology.organism_classificationGenes Mating Type FungalEuropeGenetics PopulationHaplotypesFounder effectMolecular ecology
researchProduct

The colonization history of Olea europaea L. in Macaronesia based on internal transcribed spacer 1 (ITS-1) sequences, randomly amplified polymorphic …

2000

Phylogenetic relationships in the Olea europaea complex and the phylogeography of 24 populations of the Macaronesian olive (O. europaea ssp. cerasiformis) were assessed by using three molecular markers: nuclear ribosomal internal transcribed spacer 1 (ITS-1) sequences, randomly amplified polymorphic DNAs (RAPD), and intersimple sequence repeats (ISSR). Parsimony analysis of the ITS-1 sequences and Neighbour-joining (NJ) analyses of RAPD and ISSR banding variation revealed four major lineages in the O. europaea complex: (1) ssp. cuspidata; (2) ssp. cerasiformis from Madeira; (3) ssp. laperrinei; and (4) ssp. cerasiformis from the Canary Islands plus ssp. europaea. These results provide unequ…

Genetic MarkersPortugalbiologyPhylogenetic treeGenetic VariationSequence Analysis DNAbiology.organism_classificationDNA RibosomalRandom Amplified Polymorphic DNA TechniqueTreesRAPDEvolution MolecularPlant LeavesPhylogeographyOleaPhylogeneticsBotanyGeneticsBiological dispersalInternal transcribed spacerRibosomal DNAPhylogenyEcology Evolution Behavior and SystematicsRepetitive Sequences Nucleic AcidMolecular Ecology
researchProduct

Local old olive landrace varieties in Israel—Valuable plant genetic resources in olive cultivation

2008

It is assumed that the cultivation of olive trees started in the East Mediterranean in the third millennia BCE. Throughout history and until recently, successful olive clones were maintained vegetatively and were grafted either on seedlings or on spheroblasts removed from the base of the trunk. It therefore can be hypothesized that local old olive trees, older than 500 years might represent an ancient gene pool. Modern terminology categorizes local genotypes into four main variety groups. However, in traditional terminology these were further differentiated into 27 cultivars according to their phenotypic traits. This genetic diversity, along with the fact that olive trees have been cultivat…

Genetic diversityRange (biology)Plant SciencePhenotypic traitBiologyOlive treesAgronomyBotanyCultivarGene poolRootstockAgronomy and Crop ScienceEcology Evolution Behavior and SystematicsSelection (genetic algorithm)Israel Journal of Plant Sciences
researchProduct