En 2010 Chung, Graham et Knuth ont démontré une remarquable identité symétrique sur les nombres eulériens et posé le problème de trouver un q-analogue de leur identité. En utilisant les q-polynômes eulériens introduits par Shareshian-Wachs, nous avons pu obtenir une telle q-identité. La preuve bijective que nous avons imaginée, nous a permis ensuite de démontrer d'autres q-identités symétriques, en utilisant un modèle combinatoire dû à Foata-Han. Entre temps, Hyatt a introduit les fonctions quasisymétriques eulériennes colorées afin d'étudier la distribution conjointe du nombre d'excédances et de l'indice majeur sur les permutations colorées. En appliquant le Decrease Value Theorem de Foata-Han, nous donnons d'abord une nouvelle preuve de sa formule principale sur la fonction génératrice des fonctions quasisymétriques eulériennes colorées, puis généralisons certaines identités eulériennes symétriques, en les exprimant comme des identités sur les fonctions quasisymétriques eulériennes colorées. D'autre part, en prolongeant les travaux récents de Savage-Visontai et Bec-raun, nous considérons plusieurs q-polynômes de descente des mots signés. Leurs fonctions génératrices factorielles et multivariées sont explicitement calculées. Par ailleurs, nous montrons que certains de ces polynômes n'ont que des zéros réels. Enfin, nous étudions la fonction génératrice diagonale des nombres de Jacobi Stirling de deuxième espèce, en généralisant des résultats analogues pour les nombres de Stirling et Legendre-Stirling de deuxième espèce. Il s'avère que cette fonction génératrice est une série rationnelle dont le numérateur est un polynôme à coefficients entiers positifs. En appliquant la théorie des P-partitions de Stanley nous trouvons des interprétations combinatoires de ces coefficients / In 2010 Chung-Graham-Knuth proved an interesting symmetric identity for the Eulerian numbers and asked for a q-analog version. Using the q-Eulerian polynomials introduced by Shareshian-Wachs we find such a q-identity. Moreover, we provide a bijective proof that we further generalize to prove other symmetric qidentities using a combinatorial model due to Foata-Han. Meanwhile, Hyatt has introduced the colored Eulerian quasisymmetric functions to study the joint distribution of the excedance number and major index on colored permutations. Using the Decrease Value Theorem of Foata-Han we give a new proof of his main generating function formula for the colored Eulerian quasisymmetric functions. Furthermore, certain symmetric q-Eulerian identities are generalized and expressed as identities involving the colored Eulerian quasisymmetric functions. Next, generalizing the recent works of Savage-Visontai and Beck-Braun we investigate some q-descent polynomials of general signed multipermutations. The factorial and multivariate generating functions for these q-descent polynomials are obtained and the real rootedness results of some of these polynomials are given. Finally, we study the diagonal generating function of the Jacobi-Stirling numbers of the second kind by generalizing the analogous results for the Stirling and Legendre-Stirling numbers of the second kind. It turns out that the generating function is a rational function, whose numerator is a polynomial with nonnegative integral coefficients. By applying Stanley’s theory of P-partitions we find combinatorial interpretations of those coefficients

Estudamos o problema de obtenção de estimadores/preditores ótimos para combinações lineares de respostas coletadas de uma população finita por meio de amostragem aleatória simples. Nesse contexto, estendemos o modelo misto para populações finitas proposto por Stanek, Singer & Lencina (2004, Journal of Statistical Planning and Inference) para casos em que se incluem erros de medida (endógenos e exógenos) e informação auxiliar. Admitindo que as variâncias são conhecidas, mostramos que os estimadores/preditores propostos têm erro quadrático médio menor dentro da classe dos estimadores lineares não viciados. Por meio de estudos de simulação, comparamos o desempenho desses estimadores/preditores empíricos, i.e., obtidos com a substituição das componentes de variância por estimativas, com aquele de competidores tradicionais. Também, estendemos esses modelos para análise de estudos com estrutura do tipo pré-teste/pós-teste. Também por intermédio de simulação, comparamos o desempenho dos estimadores empíricos com o desempenho do estimador obtido por meio de técnicas clássicas de análise de medidas repetidas e com o desempenho do estimador obtido via análise de covariância por meio de mínimos quadrados, concluindo que os estimadores/ preditores empíricos apresentaram um menor erro quadrático médio e menor vício. Em geral, sugerimos o emprego dos estimadores/preditores empíricos propostos para dados com distribuição assimétrica ou amostras pequenas. / We consider optimal estimation of finite population parameters with data obtained via simple random samples. In this context, we extend a finite population mixed model proposed by Stanek, Singer & Lencina (2004, Journal of Statistical Planning and Inference) by including measurement errors (endogenous or exogenous) and auxiliary information. Assuming that variance components are known, we show that the proposed estimators/predictors have the smallest mean squared error in the class of unbiased estimators. Using simulation studies, we compare the performance of the empirical estimators/predictors obtained by replacing variance components with estimates with the performance of a traditional estimator. We also extend the finite population mixed model to data obtained via pretest-posttest designs. Through simulation studies, we compare the performance of the empirical estimator of the difference in gain between groups with the performance of the usual repeated measures estimator and with the performance of the usual analysis of covariance estimator obtained via ordinary least squares. The empirical estimator has smaller mean squared error and bias than the alternative estimators under consideration. In general, we recommend the use of the proposed estimators/ predictors for either asymmetric response distributions or small samples.

Cette thèse porte sur la théorie des modèles des structures pseudo-finies en mettant l’accent sur les groupes et les corps. Le but est d'approfondir notre compréhension des interactions entre les dimensions de comptage pseudo-finies et les propriétés algébriques de leurs structures sous-jacentes, ainsi que de la classification de certaines classes de structures en fonction de leurs dimensions. Notre approche se fait par l'étude d'exemples. Nous avons examiné trois classes de structures. La première est la classe des H-structures, qui sont des expansions génériques. Nous avons donné une construction explicite de H-structures pseudo-finies comme ultraproduits de structures finies. Le deuxième exemple est la classe des corps aux différences finis. Nous avons étudié les propriétés de la dimension pseudo-finie grossière de cette classe. Nous avons montré qu'elle est définissable et prend des valeurs entières, et nous avons trouvé un lien partiel entre cette dimension et le degré de transcendance transformelle. Le troisième exemple est la classe des groupes de permutations primitifs pseudo-finis. Nous avons généralisé le théorème classique de classification de Hrushovski pour les groupes stables de permutations d'un ensemble fortement minimal au cas où une dimension abstraite existe, cas qui inclut à la fois les rangs classiques de la théorie des modèles et les dimensions de comptage pseudo-finies. Dans cette thèse, nous avons aussi généralisé le théorème de Schlichting aux sous-groupes approximatifs, en utilisant une notion de commensurabilité / This thesis is about the model theory of pseudofinite structures with the focus on groups and fields. The aim is to deepen our understanding of how pseudofinite counting dimensions can interact with the algebraic properties of underlying structures and how we could classify certain classes of structures according to their counting dimensions. Our approach is by studying examples. We treat three classes of structures: The first one is the class of H-structures, which are generic expansions of existing structures. We give an explicit construction of pseudofinite H-structures as ultraproducts of finite structures. The second one is the class of finite difference fields. We study properties of coarse pseudofinite dimension in this class, show that it is definable and integer-valued and build a partial connection between this dimension and transformal transcendence degree. The third example is the class of pseudofinite primitive permutation groups. We generalise Hrushovski's classical classification theorem for stable permutation groups acting on a strongly minimal set to the case where there exists an abstract notion of dimension, which includes both the classical model theoretic ranks and pseudofinite counting dimensions. In this thesis, we also generalise Schlichting's theorem for groups to the case of approximate subgroups with a notion of commensurability

Für die makroskopischen Eigenschaften und Funktionen biologisch relevanter Materie spielen schwache, intra- und intermolekulare Wechselwirkungen dispersiver und elektrostatischer Natur auf molekularem Niveau eine große Rolle. Um diese schwachen Wechselwirkungen zu untersuchen, können Modellsysteme, isoliert in der Gasphase, herangezogen werden. Benzoldimer, ein schwach gebundener Van der Waals Komplex, kann beispielsweise als Modellsystem für dispersive Wechselwirkungen dienen. In der vorliegenden Arbeit werden die strukturellen Eigenschaften und die (interne) Dynamik des Benzoldimers mit Hilfe spektroskopischer Methoden in den Energiebereichen der Rotationen, Vibrationen und elektronischen Übergänge untersucht und im Kontext der Symmetrie diskutiert. Die in dieser Arbeit vorgestellten Experimente tragen zu einem tieferen Verständnis des Benzoldimers bei, jedoch zeigt das Experiment zur internen Dynamik auch, dass eine ausreichende theoretische Beschreibung des Benzoldimers nach wie vor eine Herausforderung darstellt. Schwingungsübergänge hochsymmetrischer Moleküle sind oft optisch inaktiv, können jedoch mit der hier vorgestellten Methode der Symmetrieerniedrigung durch Komplexierung zugänglich gemacht werden, wie am Beispiel des Benzols demonstriert wird. Außerdem wird ein Mechanismus vorgstellt, der kollisionsinduzierte Konformationsänderungen in einem Molekularstrahl beschreibt. Dieses Modell kann generell für Molekularstrahlexperimente an flexiblen Molekülen hilfreich sein, einerseits um die beobachtete Konformationsverteilung zu verstehen, andererseits um die experimentellen Parameter gezielt zu verändern und somit Konformerpopulationen zu manipulieren. Die in dieser Dissertation vorgestellten spektroskopischen Experimente liefern einerseits molekülspezifische Informationen und ermöglichen andererseits, Modelle, die von allgemeiner Bedeutung sind, zu entwickeln. / The macroscopically observable properties and functionalities of biological matter are often determined by weak intra- and intermolecular interactions on the microscopic level. Such weak interactions are for example hydrogen bonding and van der Waals interactions and can be investigated best on isolated model systems in the gas phase. The benzene dimer, for example, is a prototype system to investgate dispersive interactions. The spectroscopic experiments, covering the energy ranges of rotations, vibrations and electronic transitions, presented in this thesis, contribute to a deeper understanding of the benzene dimer. However, from the experiments investigating the internal dynamics it becomes clear that an appropriate theoretical description of the benzene dimer is still a challenge. Vibrational transitions of highly symmetric molecules, as for example of the benzene, are often optically inactive. Here, a method is presented, which exploits symmetry reduction upon complexation and thus allows one to access such modes. Furthermore, a model is proposed describing collision induced conformational interconversion in a molecular beam. This model can be helpful for molecular beam experiments of flexible molecules to understand the observed relative conformational population and to adapt the experimental conditions allowing for the manipulation of the relative conformer abundances. In this thesis, results are presented that allow one on the one hand to deduce molecular specific information and that on the other hand also give a broader insight into phenomena of general importance.

在現今生物醫學領域中，一重要課題為透過基因實驗所獲得的量化資料，來研究與分析基因與外顯表型變數(phenotype)的相關性。已知多數已發展的方法皆屬於單基因分析法，無法適當的考慮基因之間的相關性。本研究主要針對基因組分析(gene set analysis)問題，提出統計檢定方法來驗證特定基因組的顯著性。為了能盡其所能的捕捉整體基因組與外顯表型變數的關係，我們結合了傳統的檢定方法與分類方法，提出以隨機森林分類方法(Random Forests)的測試組分類誤差值(test error)作為檢定統計量(test statistic)，並以其排列顯著值(permutation-based p-value)來獲得統計結論。我們透過模擬研究將本研究方法和其他七種基因組分析方法做比較，可發現本方法在型一誤差率(type I error rate)和檢定力(power)上皆有優異表現。最後，我們運用本方法在數個實際基因資料組的分析上，並深入探討所獲得結果。 / Nowadays microarray data analysis has become an important issue in biomedical research. One major goal is to explore the relationship between gene expressions and some specific phenotypes. So far in literatures many developed methods are single gene-based methods, which use solely the information of individual genes and cannot appropriately take into account the relationship among genes. This research focuses on the gene set analysis, which carries out the statistical test for the significance of a set of genes to a phenotype. In order to capture the relationship between a gene set and the phenotype, we propose the use of performance of a complex classifier in the statistical test: The test error rate of a Random Forests classification is adopted as the test statistic, and the statistical conclusion is drawn according to its permutation-based p-value. We compare our test with other seven existing gene set analyses through simulation studies. It’s found that our method has leading performance in terms of having a controlled type I error rate and a high power. Finally, this method is applied in several real examples and brief discussions on the results are provided.

This thesis deals with enumerative combinatorics applied to three different objects related to partition shapes, namely tableaux, restricted words, and Bruhat intervals. The main scientific contributions are the following. Paper I: Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Stanley says that the sum of the signs of all SYTs with n squares is 2^[n/2]. We prove a generalisation of this conjecture using the Robinson-Schensted correspondence and a new concept called chess tableaux. The proof is built on a remarkably simple relation between the sign of a permutation pi and the signs of its RS-corresponding tableaux P and Q, namely sgn(pi) = (−1)^v sgn(P)sgn(Q), where v is the number of disjoint vertical dominoes that fit in the partition shape of P and Q. The sign-imbalance of a partition shape is defined as the sum of the signs of all standard Young tableaux of that shape. As a further application of the sign-transferring formula above, we also prove a sharpening of another conjecture by Stanley concerning weighted sums of squares of sign-imbalances. Paper II: We generalise some of the results in paper I to skew tableaux. More precisely, we examine how the sign property is transferred by the skew Robinson-Schensted correspondence invented by Sagan and Stanley. The result is a surprisingly simple generalisation of the ordinary non-skew formula above. As an application, we find vanishing weighted sums of squares of sign-imbalances, thereby generalising a variant of Stanley’s second conjecture. Paper III: The following special case of a conjecture by Loehr and Warrington was proved by Ekhad, Vatter, and Zeilberger: There are 10^n zero-sum words of length 5n in the alphabet {+3,−2} such that no consecutive subword begins with +3, ends with −2, and sums to −2. We give a simple bijective proof of the conjecture in its original and more general setting where 3 and 2 are replaced by any relatively prime positive integers a and b, 10^n is replaced by ((a+b) choose a)^n, and 5n is replaced by (a+b)n. To do this we reformulate the problem in terms of cylindrical lattice walks which can be interpreted as the south-east border of certain partition shapes. Paper IV: We characterise the permutations pi such that the elements in the closed lower Bruhat interval [id,pi] of the symmetric group correspond to non-capturing rook configurations on a skew Ferrers board. These intervals turn out to be exactly those whose flag manifolds are defined by inclusions, as defined by Gasharov and Reiner. The characterisation connects Poincaré polynomials (rank-generating functions) of Bruhat intervals with q-rook polynomials, and we are able to compute the Poincaré polynomial of some particularly interesting intervals in the finite Weyl groups A_n and B_n. The expressions involve q-Stirling numbers of the second kind, and for the group A_n putting q = 1 yields the poly-Bernoulli numbers defined by Kaneko. / Ämnet för denna avhandling är enumerativ kombinatorik tillämpad på tre olika objekt med anknytning till partitionsformer, nämligen tablåer, begränsade ord och bruhatintervall. Dom viktigaste vetenskapliga bidragen är följande. Artikel I: Låt tecknet av en standardtablå vara tecknet hos permutationen man får om man läser tablån rad för rad från vänster till höger, som en bok. En förmodan av Richard Stanley säjer att teckensumman av alla standardtablåer med n rutor är 2^[n/2]. Vi visar en generalisering av denna förmodan med hjälp av Robinson-Schensted-korrespondensen och ett nytt begrepp som vi kallar schacktablåer. Beviset bygger på ett anmärkningsvärt enkelt samband mellan tecknet hos en permutation pi och tecknen hos dess RS-motsvarande tablåer P och Q, nämligen sgn(pi)=(-1)^v sgn(P)sgn(Q), där v är antalet disjunkta vertikala dominobrickor som får plats i partitionsformen hos P och Q. Teckenobalansen hos en partitionsform definieras som teckensumman av alla standardtablåer av den formen. Som en ytterligare tillämpning av formeln för teckenöverföring ovan bevisar vi också en starkare variant av en annan förmodan av Stanley som handlar om viktade summor av kvadrerade teckenobalanser. Artikel II: Vi generaliserar några av resultaten i artikel I till skeva tablåer. Närmare bestämt undersöker vi hur teckenegenskapen överförs av Sagan och Stanleys skeva Robinson-Schensted-korrespondens. Resultatet är en förvånansvärt enkel generalisering av den vanliga ickeskeva formeln ovan. Som en tillämpning visar vi att vissa viktade summor av kvadrerade teckenobalanser blir noll, vilket leder till en generalisering av en variant av Stanleys andra förmodan. Artikel III: Följande specialfall av en förmodan av Loehr och Warrington bevisades av Ekhad, Vatter och Zeilberger: Det finns 10^n ord med summan noll av längd 5n i alfabetet {+3,-2} sådana att inget sammanhängande delord börjar med +3, slutar med -2 och har summan -2. Vi ger ett enkelt bevis för denna förmodan i dess ursprungliga allmännare utförande där 3 och 2 byts ut mot vilka som helst relativt prima positiva heltal a och b, 10^n byts ut mot ((a+b) över a)^n och 5n mot (a+b)n. För att göra detta formulerar vi problemet i termer av cylindriska latticestigar som kan tolkas som den sydöstra gränslinjen för vissa partitionsformer. Artikel IV: Vi karakteriserar dom permutationer pi sådana att elementen i det slutna bruhatintervallet [id,pi] i symmetriska gruppen motsvarar ickeslående tornplaceringar på ett skevt ferrersbräde. Dessa intervall visar sej vara precis dom vars flaggmångfalder är definierade av inklusioner, ett begrepp introducerat av Gasharov och Reiner. Karakteriseringen skapar en länk mellan poincarépolynom (ranggenererande funktioner) för bruhatintervall och q-tornpolynom, och vi kan beräkna poincarépolynomet för några särskilt intressanta intervall i dom ändliga weylgrupperna A_n och B_n. Uttrycken innehåller q-stirlingtal av andra sorten, och sätter man q=1 för grupp A_n så får man Kanekos poly-bernoullital. / QC 20100818

Nous considérons le problème de la séparation de mélanges audio réverbérants déterminés et sous-déterminés, c'est-à-dire l'extraction du signal de chaque source dans un mélange multicanal. Nous proposons un cadre général de modélisation gaussienne où la contribution de chaque source aux canaux du mélange dans le domaine temps-fréquence est modélisée par un vecteur aléatoire gaussien de moyenne nulle dont la covariance encode à la fois les caractéristiques spatiales et spectrales de la source. A n de mieux modéliser la réverbération, nous nous aff ranchissons de l'hypothèse classique de bande étroite menant à une covariance spatiale de rang 1 et nous calculons la borne théorique de performance atteignable avec une covariance spatiale de rang plein. Les ré- sultats expérimentaux indiquent une augmentation du rapport Signal-à-Distorsion (SDR) de 6 dB dans un environnement faiblement à très réverbérant, ce qui valide cette généralisation. Nous considérons aussi l'utilisation de représentations temps-fréquence quadratiques et de l'échelle fréquentielle auditive ERB (equivalent rectangular bandwidth) pour accroître la quantité d'information exploitable et décroître le recouvrement entre les sources dans la représentation temps-fréquence. Après cette validation théorique du cadre proposé, nous nous focalisons sur l'estimation des paramètres du modèle à partir d'un signal de mélange donné dans un scénario pratique de séparation aveugle de sources. Nous proposons une famille d'algorithmes Expectation-Maximization (EM) pour estimer les paramètres au sens du maximum de vraisemblance (ML) ou du maximum a posteriori (MAP). Nous proposons une famille d'a priori de position spatiale inspirée par la théorie de l'acoustique des salles ainsi qu'un a priori de continuité spatiale. Nous étudions aussi l'utilisation de deux a priori spectraux précédemment utilisés dans un contexte monocanal ou multicanal de rang 1: un a priori de continuité spatiale et un modèle de factorisation matricielle positive (NMF). Les résultats de séparation de sources obtenus par l'approche proposée sont comparés à plusieurs algorithmes de base et de l'état de l'art sur des mélanges simulés et sur des enregistrements réels dans des scénarios variés.

A fusion protein composed of antibody fragments and β-lactamase was earlier created by Kojima et al. (2011), with antigen specificities against a bone disease marker and a pesticide. The enzyme was circularly permutated and fused to the variable heavy and light chain antibody fragments, thereby ensuring inactivity until binding of the target antigen triggered enzyme activation. Upon activation, the β-lactamase produced a colorimetric signal, which indicated antigen presence. In this work, a similar strategy was used to create two novel fusion proteins composed of circularly permuted β-lactamase and superfolder green fluorescent protein with anti-benzo[a]pyrene variable antibody fragments. The fusion proteins were designed and expressed in E. coli for the development of a single-step visual immunoassay. It was hypothesized that the cp reporter proteins would be activated once the binding of B[a]P to the variable antibody fragments occurred, and this interaction was expected to produce a detectable colorimetric or fluorescent signal. Although positive results were obtained in one instance, substantial supportive evidence in favour of the hypothesis could not be obtained. / SENTINEL Bioactive Paper Network, Natural Sciences and Engineering Research Council of Canada (NSERC), Canada Research Chairs Program.

The unique problems encountered when analyzing weather data sets - that is, measurements taken while conducting a meteorological experiment- have forced statisticians to reconsider the conventional analysis methods and investigate permutation test procedures. The problems encountered when analyzing weather data sets are simulated for a Monte Carlo study, and the results of the parametric and permutation t-tests are compared with regard to significance level, power, and the average coilfidence interval length. Seven population distributions are considered - three are variations of the normal distribution, and the others the gamma, the lognormal, the rectangular and empirical distributions. The normal distribution contaminated with zero measurements is also simulated. In those simulated situations in which the variances are unequal, the permutation test procedure was performed using other test statistics, namely the Scheffe, Welch and Behrens-Fisher test statistics. / Mathematical Sciences / M. Sc. (Statistics)

Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2017-09-13T18:01:57Z No. of bitstreams: 2 Dissertação - Roney Lopes Lima - 2017.pdf: 3471034 bytes, checksum: 2dd29fe3cd16f3d5ac0ddabf0ce316b4 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-09-19T14:01:45Z (GMT) No. of bitstreams: 2 Dissertação - Roney Lopes Lima - 2017.pdf: 3471034 bytes, checksum: 2dd29fe3cd16f3d5ac0ddabf0ce316b4 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2017-09-19T14:01:45Z (GMT). No. of bitstreams: 2 Dissertação - Roney Lopes Lima - 2017.pdf: 3471034 bytes, checksum: 2dd29fe3cd16f3d5ac0ddabf0ce316b4 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-08-23 / Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG / The application of Evolutionary Algorithms in the solution of problems characterized by the unviability through deterministic methods, has made this technique a vast object investigated. Its application to Network Design Problems (NDPs), has been specially studied. NDPs are characterized by modeling real world problems related to network design applied to resource distribution, logistics, telecommunications, routing and even social networks. The solution to these problems involves searching for a graph such as trees that meets criteria for cost minimization, availability, scaling among other constraints that make them complex. The application of Evolutionary Agorithms to NDPs requires a Representation that codes solutions properly towards to these problems. The Node-Depth Encoding (NDE) has been studied and presented results that have aroused the attention of researchers in this topic. In this work, we propose the development of a new recombination operator for NDE called NCX, based on the permutation recombination operator CX. In addition, a method is proposed for correction of infeasible solutions due to an invalid depth for a position in the array. The correction method is applied to both NCX, NOX and NPBX. The operators with their methods of correction are validated for the bias and heritability properties and finally are applied to the Bounded Diameter Minimmum Spanning Tree (BDMSTP) through Evolutionary Algorithms developed for this NDP. The results show that the operators have bias towards to star like trees and good heritability of the edges and depths of the vertices. The developed operators also showed competitiveness when applied to the BDMSTP, even surpassing other representations in the quality of the solutions. / A aplicação de Algoritmos Evolutivos na resolução de problemas caracterizados pela inviabilidade de solução através de métodos determinísticos, fez dessa técnica um objeto vastamente investigado. Sua aplicação para Problemas de Projeto de Redes (PPRs), tem sido especialmente estudada. PPRs são caracterizados por modelar problemas reais relacionados a design de redes aplicados a distribuição de recursos, logística, telecomunicações, roteamento e até mesmo redes sociais. A solução desses problemas envolve a busca de um grafo como uma árvore por exemplo que atenda a critérios de minimização de custos, disponibilidade, escala entre outras restrições que os tornam complexos. A aplicação de Algoritmos Evolutivos a PPRs demanda a utilização de uma Representação que codifique adequadamente soluções para esses problemas. A Representação Nó-Profundidade (RNP) tem sido estudada e apresentado resultados que despertaram a atenção dos pesquisadores nesse tema. Neste trabalho, propõe-se o desenvolvimento de um novo operador de recombinação para a RNP chamado NCX, com base no operador CX de recombinação em permutações. Além disso, é proposto um método para correção de soluções infactíveis devido a profundidade inválida para a posição no \textit{array}. O método de correção é aplicado tanto para NCX, quanto para outros dois operadores de recombinação já desenvolvidos para a RNP, o NOX cujo funcioamento é inspirado no operador OX, e NPBX cujo funcionamento é inspirado no operador PBX. Os operadores com os seus devidos métodos de correção são validados para as propriedades tendência e hereditariedade e por fim são aplicados ao Problema da Árvore Geradora Mínima com Restrição de Diâmetro (BDMSTP) através de Algoritmos Evolutivos desenvolvidos para esse PPR. Os resultados mostram que os operadores possuem tendência para árvores estrela e boa hereditariedade das arestas e das profundidades dos vértices. Os operadores desenvolvidos também mostraram competitividade ao serem aplicados ao BDMSTP, chegando a superar outras representações em qualidade das soluções.