Results 101 to 110 of about 10,152,062 (308)
, 2020 : In this note, we study the largest matching roots of unicyclic graphs with a given number of fixed matching number. We also characterize the extremal graph with respect to the largest matching roots. In addition, we also study this problem on the trees
Guangting Chen, Hailiang Zhang
core
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Aggregate Matching Function. The Case of Poland [PDF]
The main goal of this paper is to analyze the matching function in the Polish labour market in 1994-2008. Matching function is the relationship between outflows from unemployment to employment and the number of unemployed persons and vacancies as well as
Sylwia Roszkowska
core
Intuitionistic fuzzy XML query matching and rewriting [PDF]
, 2013 With the emergence of XML as a standard for data representation, particularly on the web, the need for intelligent query languages that can operate on XML documents with structural heterogeneity has recently gained a lot of popularity.
Alzebdi, M.
core +1 more source
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Complete solution for the rainbow numbers of matchings
Discrete Mathematics, 2009 20 ...
He Chen 0002 +2 more
openaire +4 more sources
Counting Combinatorial Choice Rules [PDF]
I count the number of combinatorial choice rules that satisfy certain properties: Kelso-Crawford substitutability, and independence of irrelevant alternatives.
Federico Echenique
core
Putting Context into Schema Matching [PDF]
, 2006 Attribute-level schema matching has proven to be an important first step in developing mappings for data exchange, integration, restructuring and schema evolution. In this paper we investigate contextual schema matching, in which selection conditions are
Elnahrawy, Eiman +3 more
core
Effective Ontology Matching in High-Performance Computing Environments
, 2009 Extending complex information structures by means of ontology matching is of high interest for a number of tasks solved in the semantic web. The main motivation behind this work is that the procedure of ontology matching requires a robust and scalable ...
Cheptsov, Alexey, Tenschert, Axel
core +1 more source