Tradução: língua e comunicação no contexto diplomático

Relatório de estágio de mestrado em Tradução e Comunicação Multilingue

Recombination in Glomus intraradices, a supposed ancient asexual arbuscular mycorrhizal fungus

Background: Arbuscular mycorrhizal fungi (AMF) are important symbionts of most plant species, promoting plant diversity and productivity. This symbiosis is thought to have contributed to the early colonisation of land by plants. Morphological stasis over 400 million years and the lack of an observed sexual stage in any member of the phylum Glomeromycota led to the controversial suggestion of AMF being ancients asexuals. Evidence for recombination in AMF is contradictory. Results: We addressed the question of recombination in the AMF Glomus intraradices by sequencing 11 polymorphic nuclear loci in 40 morphologically identical isolates from one field. Phylogenetic relationships among genotypes showed a reticulate network pattern providing a rationale to test for recombination. Five statistical tests predicted multiple recombinant regions in the genome of a core set of isolates. In contrast, five clonal lineages had fixed a large number of differences. Conclusion: Our data show that AMF from one field have undergone recombination but that clonal lineages coexist. This finding has important consequences for understanding AMF evolution, co-evolution of AMF and plants and highlights the potential for commercially introduced AMF inoculum recombining with existing local populations. Finally, our results reconcile seemingly contradictory studies on whether AMF are clonal or form recombining populations.

Fault location in underground systems through optimum-path forest

In this paper we propose an accurate method for fault location in underground distribution systems by means of an Optimum-Path Forest (OPF) classifier. We applied the Time Domains Reflectometry method for signal acquisition, which was further analyzed by OPF and several other well known pattern recognition techniques. The results indicated that OPF and Support Vector Machines outperformed Artificial Neural Networks classifier. However, OPF has been much more efficient than all classifiers for training, and the second one faster for classification. © 2011 IEEE.

Uma arqueologia de diagramas cibernéticos

This paper investigates the use of explicit structures of information in architectural design. Particularly, it approaches the use of diagrams related to cybernetics and information theory in experimental practices in the 1960’s and 1970’s. It analyses the diagram of cybernetic control proposed by the cybernetician Gordon Pask for the Fun Palace, the diagrams produced by the utopian architect Yona Friedman in the conceptual description of the Flatwriter program and Christopher Alexander’s diagrams and his theories of Synthesis of Form and Pattern Language. Finally it establishes a brief parallel between current domestication and use of dataflow programming with the cybernetic diagrams, highlighting differences in their complexity approach.

Dynamic directed interictal connectivity in left and right temporal lobe epilepsy.

OBJECTIVE There is increasing evidence that epileptic activity involves widespread brain networks rather than single sources and that these networks contribute to interictal brain dysfunction. We investigated the fast-varying behavior of epileptic networks during interictal spikes in right and left temporal lobe epilepsy (RTLE and LTLE) at a whole-brain scale using directed connectivity. METHODS In 16 patients, 8 with LTLE and 8 with RTLE, we estimated the electrical source activity in 82 cortical regions of interest (ROIs) using high-density electroencephalography (EEG), individual head models, and a distributed linear inverse solution. A multivariate, time-varying, and frequency-resolved Granger-causal modeling (weighted Partial Directed Coherence) was applied to the source signal of all ROIs. A nonparametric statistical test assessed differences between spike and baseline epochs. Connectivity results between RTLE and LTLE were compared between RTLE and LTLE and with neuropsychological impairments. RESULTS Ipsilateral anterior temporal structures were identified as key drivers for both groups, concordant with the epileptogenic zone estimated invasively. We observed an increase in outflow from the key driver already before the spike. There were also important temporal and extratemporal ipsilateral drivers in both conditions, and contralateral only in RTLE. A different network pattern between LTLE and RTLE was found: in RTLE there was a much more prominent ipsilateral to contralateral pattern than in LTLE. Half of the RTLE patients but none of the LTLE patients had neuropsychological deficits consistent with contralateral temporal lobe dysfunction, suggesting a relationship between connectivity changes and cognitive deficits. SIGNIFICANCE The different patterns of time-varying connectivity in LTLE and RTLE suggest that they are not symmetrical entities, in line with our neuropsychological results. The highest outflow region was concordant with invasive validation of the epileptogenic zone. This enhanced characterization of dynamic connectivity patterns could better explain cognitive deficits and help the management of epilepsy surgery candidates.

Altered directed functional connectivity in temporal lobe epilepsy in the absence of interictal spikes: A high density EEG study.

OBJECTIVE In patients with epilepsy, seizure relapse and behavioral impairments can be observed despite the absence of interictal epileptiform discharges (IEDs). Therefore, the characterization of pathologic networks when IEDs are not present could have an important clinical value. Using Granger-causal modeling, we investigated whether directed functional connectivity was altered in electroencephalography (EEG) epochs free of IED in left and right temporal lobe epilepsy (LTLE and RTLE) compared to healthy controls. METHODS Twenty LTLE, 20 RTLE, and 20 healthy controls underwent a resting-state high-density EEG recording. Source activity was obtained for 82 regions of interest (ROIs) using an individual head model and a distributed linear inverse solution. Granger-causal modeling was applied to the source signals of all ROIs. The directed functional connectivity results were compared between groups and correlated with clinical parameters (duration of the disease, age of onset, age, and learning and mood impairments). RESULTS We found that: (1) patients had significantly reduced connectivity from regions concordant with the default-mode network; (2) there was a different network pattern in patients versus controls: the strongest connections arose from the ipsilateral hippocampus in patients and from the posterior cingulate cortex in controls; (3) longer disease duration was associated with lower driving from contralateral and ipsilateral mediolimbic regions in RTLE; (4) aging was associated with a lower driving from regions in or close to the piriform cortex only in patients; and (5) outflow from the anterior cingulate cortex was lower in patients with learning deficits or depression compared to patients without impairments and to controls. SIGNIFICANCE Resting-state network reorganization in the absence of IEDs strengthens the view of chronic and progressive network changes in TLE. These resting-state connectivity alterations could constitute an important biomarker of TLE, and hold promise for using EEG recordings without IEDs for diagnosis or prognosis of this disorder.

Nepfix: on-demand cloud elastic simulation of networks of evolutionary processors

Una Red de Procesadores Evolutivos o NEP (por sus siglas en ingles), es un modelo computacional inspirado por el modelo evolutivo de las celulas, específicamente por las reglas de multiplicación de las mismas. Esta inspiración hace que el modelo sea una abstracción sintactica de la manipulation de information de las celulas. En particu¬lar, una NEP define una maquina de cómputo teorica capaz de resolver problemas NP completos de manera eficiente en tóerminos de tiempo. En la praóctica, se espera que las NEP simuladas en móaquinas computacionales convencionales puedan resolver prob¬lemas reales complejos (que requieran ser altamente escalables) a cambio de una alta complejidad espacial. En el modelo NEP, las cóelulas estóan representadas por palabras que codifican sus secuencias de ADN. Informalmente, en cualquier momento de cómputo del sistema, su estado evolutivo se describe como un coleccion de palabras, donde cada una de ellas representa una celula. Estos momentos fijos de evolucion se denominan configuraciones. De manera similar al modelo biologico, las palabras (celulas) mutan y se dividen en base a bio-operaciones sencillas, pero solo aquellas palabras aptas (como ocurre de forma parecida en proceso de selection natural) seran conservadas para la siguiente configuracióon. Una NEP como herramienta de computation, define una arquitectura paralela y distribuida de procesamiento simbolico, en otras palabras, una red de procesadores de lenguajes. Desde el momento en que el modelo fue propuesto a la comunidad científica en el año 2001, múltiples variantes se han desarrollado y sus propiedades respecto a la completitud computacional, eficiencia y universalidad han sido ampliamente estudiadas y demostradas. En la actualidad, por tanto, podemos considerar que el modelo teórico NEP se encuentra en el estadio de la madurez. La motivación principal de este Proyecto de Fin de Grado, es proponer una aproxi-mación práctica que permita dar un salto del modelo teórico NEP a una implantación real que permita su ejecucion en plataformas computacionales de alto rendimiento, con el fin de solucionar problemas complejos que demanda la sociedad actual. Hasta el momento, las herramientas desarrolladas para la simulation del modelo NEP, si bien correctas y con resultados satisfactorios, normalmente estón atadas a su entorno de ejecucion, ya sea el uso de hardware específico o implementaciones particulares de un problema. En este contexto, el propósito fundamental de este trabajo es el desarrollo de Nepfix, una herramienta generica y extensible para la ejecucion de cualquier algo¬ritmo de un modelo NEP (o alguna de sus variantes), ya sea de forma local, como una aplicación tradicional, o distribuida utilizando los servicios de la nube. Nepfix es una aplicacion software desarrollada durante 7 meses y que actualmente se encuentra en su segunda iteration, una vez abandonada la fase de prototipo. Nepfix ha sido disenada como una aplicacion modular escrita en Java 8 y autocontenida, es decir, no requiere de un entorno de ejecucion específico (cualquier maquina virtual de Java es un contenedor vólido). Nepfix contiene dos componentes o móodulos. El primer móodulo corresponde a la ejecución de una NEP y es por lo tanto, el simulador. Para su desarrollo, se ha tenido en cuenta el estado actual del modelo, es decir, las definiciones de los procesadores y filtros mas comunes que conforman la familia del modelo NEP. Adicionalmente, este componente ofrece flexibilidad en la ejecucion, pudiendo ampliar las capacidades del simulador sin modificar Nepfix, usando para ello un lenguaje de scripting. Dentro del desarrollo de este componente, tambióen se ha definido un estóandar de representacióon del modelo NEP basado en el formato JSON y se propone una forma de representation y codificación de las palabras, necesaria para la comunicación entre servidores. Adicional-mente, una característica importante de este componente, es que se puede considerar una aplicacion aislada y por tanto, la estrategia de distribution y ejecución son total-mente independientes. El segundo moódulo, corresponde a la distribucióon de Nepfix en la nube. Este de-sarrollo es el resultado de un proceso de i+D, que tiene una componente científica considerable. Vale la pena resaltar el desarrollo de este modulo no solo por los resul-tados prócticos esperados, sino por el proceso de investigation que se se debe abordar con esta nueva perspectiva para la ejecución de sistemas de computación natural. La principal característica de las aplicaciones que se ejecutan en la nube es que son gestionadas por la plataforma y normalmente se encapsulan en un contenedor. En el caso de Nepfix, este contenedor es una aplicacion Spring que utiliza el protocolo HTTP o AMQP para comunicarse con el resto de instancias. Como valor añadido, Nepfix aborda dos perspectivas de implementation distintas (que han sido desarrolladas en dos iteraciones diferentes) del modelo de distribution y ejecucion, que tienen un impacto muy significativo en las capacidades y restricciones del simulador. En concreto, la primera iteration utiliza un modelo de ejecucion asincrono. En esta perspectiva asincrona, los componentes de la red NEP (procesadores y filtros) son considerados como elementos reactivos a la necesidad de procesar una palabra. Esta implementation es una optimization de una topologia comun en el modelo NEP que permite utilizar herramientas de la nube para lograr un escalado transparente (en lo ref¬erente al balance de carga entre procesadores) pero produce efectos no deseados como indeterminacion en el orden de los resultados o imposibilidad de distribuir eficiente-mente redes fuertemente interconectadas. Por otro lado, la segunda iteration corresponde al modelo de ejecucion sincrono. Los elementos de una red NEP siguen un ciclo inicio-computo-sincronizacion hasta que el problema se ha resuelto. Esta perspectiva sincrona representa fielmente al modelo teórico NEP pero el proceso de sincronizacion es costoso y requiere de infraestructura adicional. En concreto, se requiere un servidor de colas de mensajes RabbitMQ. Sin embargo, en esta perspectiva los beneficios para problemas suficientemente grandes superan a los inconvenientes, ya que la distribuciín es inmediata (no hay restricciones), aunque el proceso de escalado no es trivial. En definitiva, el concepto de Nepfix como marco computacional se puede considerar satisfactorio: la tecnología es viable y los primeros resultados confirman que las carac-terísticas que se buscaban originalmente se han conseguido. Muchos frentes quedan abiertos para futuras investigaciones. En este documento se proponen algunas aproxi-maciones a la solucion de los problemas identificados como la recuperacion de errores y la division dinamica de una NEP en diferentes subdominios. Por otra parte, otros prob-lemas, lejos del alcance de este proyecto, quedan abiertos a un futuro desarrollo como por ejemplo, la estandarización de la representación de las palabras y optimizaciones en la ejecucion del modelo síncrono. Finalmente, algunos resultados preliminares de este Proyecto de Fin de Grado han sido presentados recientemente en formato de artículo científico en la "International Work-Conference on Artificial Neural Networks (IWANN)-2015" y publicados en "Ad-vances in Computational Intelligence" volumen 9094 de "Lecture Notes in Computer Science" de Springer International Publishing. Lo anterior, es una confirmation de que este trabajo mas que un Proyecto de Fin de Grado, es solo el inicio de un trabajo que puede tener mayor repercusion en la comunidad científica. Abstract Network of Evolutionary Processors -NEP is a computational model inspired by the evolution of cell populations, which might model some properties of evolving cell communities at the syntactical level. NEP defines theoretical computing devices able to solve NP complete problems in an efficient manner. In this model, cells are represented by words which encode their DNA sequences. Informally, at any moment of time, the evolutionary system is described by a collection of words, where each word represents one cell. Cells belong to species and their community evolves according to mutations and division which are defined by operations on words. Only those cells are accepted as surviving (correct) ones which are represented by a word in a given set of words, called the genotype space of the species. This feature is analogous with the natural process of evolution. Formally, NEP is based on an architecture for parallel and distributed processing, in other words, a network of language processors. Since the date when NEP was pro¬posed, several extensions and variants have appeared engendering a new set of models named Networks of Bio-inspired Processors (NBP). During this time, several works have proved the computational power of NBP. Specifically, their efficiency, universality, and computational completeness have been thoroughly investigated. Therefore, we can say that the NEP model has reached its maturity. The main motivation for this End of Grade project (EOG project in short) is to propose a practical approximation that allows to close the gap between theoretical NEP model and a practical implementation in high performing computational platforms in order to solve some of high the high complexity problems society requires today. Up until now tools developed to simulate NEPs, while correct and successful, are usu¬ally tightly coupled to the execution environment, using specific software frameworks (Hadoop) or direct hardware usage (GPUs). Within this context the main purpose of this work is the development of Nepfix, a generic and extensible tool that aims to execute algorithms based on NEP model and compatible variants in a local way, similar to a traditional application or in a distributed cloud environment. Nepfix as an application was developed during a 7 month cycle and is undergoing its second iteration once the prototype period was abandoned. Nepfix is designed as a modular self-contained application written in Java 8, that is, no additional external dependencies are required and it does not rely on an specific execution environment, any JVM is a valid container. Nepfix is made of two components or modules. The first module corresponds to the NEP execution and therefore simulation. During the development the current state of the theoretical model was used as a reference including most common filters and processors. Additionally extensibility is provided by the use of Python as a scripting language to run custom logic. Along with the simulation a definition language for NEP has been defined based on JSON as well as a mechanisms to represent words and their possible manipulations. NEP simulator is isolated from distribution and as mentioned before different applications that include it as a dependency are possible, the distribution of NEPs is an example of this. The second module corresponds to executing Nepfix in the cloud. The development carried a heavy R&D process since this front was not explored by other research groups until now. It's important to point out that the development of this module is not focused on results at this point in time, instead we focus on feasibility and discovery of this new perspective to execute natural computing systems and NEPs specifically. The main properties of cloud applications is that they are managed by the platform and are encapsulated in a container. For Nepfix a Spring application becomes the container and the HTTP or AMQP protocols are used for communication with the rest of the instances. Different execution perspectives were studied, namely asynchronous and synchronous models were developed for solving different kind of problems using NEPs. Different limitations and restrictions manifest in both models and are explored in detail in the respective chapters. In conclusion we can consider that Nepfix as a computational framework is suc-cessful: Cloud technology is ready for the challenge and the first results reassure that the properties Nepfix project pursued were met. Many investigation branches are left open for future investigations. In this EOG implementation guidelines are proposed for some of them like error recovery or dynamic NEP splitting. On the other hand other interesting problems that were not in the scope of this project were identified during development like word representation standardization or NEP model optimizations. As a confirmation that the results of this work can be useful to the scientific com-munity a preliminary version of this project was published in The International Work- Conference on Artificial Neural Networks (IWANN) in May 2015. Development has not stopped since that point and while Nepfix in it's current state can not be consid¬ered a final product the most relevant ideas, possible problems and solutions that were produced during the seven months development cycle are worthy to be gathered and presented giving a meaning to this EOG work.

Principal component analysis and assessment of language network activation patterns in pediatric epilepsy

This dissertation establishes a novel data-driven method to identify language network activation patterns in pediatric epilepsy through the use of the Principal Component Analysis (PCA) on functional magnetic resonance imaging (fMRI). A total of 122 subjects’ data sets from five different hospitals were included in the study through a web-based repository site designed here at FIU. Research was conducted to evaluate different classification and clustering techniques in identifying hidden activation patterns and their associations with meaningful clinical variables. The results were assessed through agreement analysis with the conventional methods of lateralization index (LI) and visual rating. What is unique in this approach is the new mechanism designed for projecting language network patterns in the PCA-based decisional space. Synthetic activation maps were randomly generated from real data sets to uniquely establish nonlinear decision functions (NDF) which are then used to classify any new fMRI activation map into typical or atypical. The best nonlinear classifier was obtained on a 4D space with a complexity (nonlinearity) degree of 7. Based on the significant association of language dominance and intensities with the top eigenvectors of the PCA decisional space, a new algorithm was deployed to delineate primary cluster members without intensity normalization. In this case, three distinct activations patterns (groups) were identified (averaged kappa with rating 0.65, with LI 0.76) and were characterized by the regions of: (1) the left inferior frontal Gyrus (IFG) and left superior temporal gyrus (STG), considered typical for the language task; (2) the IFG, left mesial frontal lobe, right cerebellum regions, representing a variant left dominant pattern by higher activation; and (3) the right homologues of the first pattern in Broca's and Wernicke's language areas. Interestingly, group 2 was found to reflect a different language compensation mechanism than reorganization. Its high intensity activation suggests a possible remote effect on the right hemisphere focus on traditionally left-lateralized functions. In retrospect, this data-driven method provides new insights into mechanisms for brain compensation/reorganization and neural plasticity in pediatric epilepsy.

Principal Component Analysis and Assessment of Language Network Activation Patterns in Pediatric Epilepsy

This dissertation establishes a novel data-driven method to identify language network activation patterns in pediatric epilepsy through the use of the Principal Component Analysis (PCA) on functional magnetic resonance imaging (fMRI). A total of 122 subjects’ data sets from five different hospitals were included in the study through a web-based repository site designed here at FIU. Research was conducted to evaluate different classification and clustering techniques in identifying hidden activation patterns and their associations with meaningful clinical variables. The results were assessed through agreement analysis with the conventional methods of lateralization index (LI) and visual rating. What is unique in this approach is the new mechanism designed for projecting language network patterns in the PCA-based decisional space. Synthetic activation maps were randomly generated from real data sets to uniquely establish nonlinear decision functions (NDF) which are then used to classify any new fMRI activation map into typical or atypical. The best nonlinear classifier was obtained on a 4D space with a complexity (nonlinearity) degree of 7. Based on the significant association of language dominance and intensities with the top eigenvectors of the PCA decisional space, a new algorithm was deployed to delineate primary cluster members without intensity normalization. In this case, three distinct activations patterns (groups) were identified (averaged kappa with rating 0.65, with LI 0.76) and were characterized by the regions of: 1) the left inferior frontal Gyrus (IFG) and left superior temporal gyrus (STG), considered typical for the language task; 2) the IFG, left mesial frontal lobe, right cerebellum regions, representing a variant left dominant pattern by higher activation; and 3) the right homologues of the first pattern in Broca's and Wernicke's language areas. Interestingly, group 2 was found to reflect a different language compensation mechanism than reorganization. Its high intensity activation suggests a possible remote effect on the right hemisphere focus on traditionally left-lateralized functions. In retrospect, this data-driven method provides new insights into mechanisms for brain compensation/reorganization and neural plasticity in pediatric epilepsy.

WAIS Seminar:Modelling the Web: Examples of modelling language, network evolution and physical-social systems

Speaker(s): Prof. Steffen Staab Organiser: Dr Tim Chown Time: 23/05/2014 10:30-11:30 Location: B53/4025 Abstract The Web is constructed based on our experiences in a multitude of modalities: text, networks, images, physical locations are some examples. Understanding the Web requires from us that we can model these modalities as they appear on the Web. In this talk I will show some examples of how we model text, hyperlink networks and physical-social systems in order to improve our understanding and our use of the Web.

Writting simple poems : pattern poetry for language acquisition.

Muestra a los profesores cómo pueden utilizar escribir poesía para enseñar y reforzar el vocabulario, la estructura y las partes de la oración, la puntuación, así como otras reglas de la gramática y la escritura. Para cualquier edad o nivel de fluidez, puede ser utilizado como lengua extranjera, o para maestros bilingües como un complemento a su programa de escritura. La primera parte del libro se centra en la metodología y ofrece sugerencias para la forma de integrar la poesía escrita con el plan de estudios. La segunda parte del libro contiene veinticinco modelos de poemas y muestras de poesía escritos por estudiantes de diversos idiomas y edades. La tercera parte del libro ofrece un índice y un glosario de términos gramaticales.

Comprehension of reflexives and pronouns in sequential bilingual children: do they pattern similarly to L1 children, L2 adults, or children with specific language impairment?

This paper investigates how sequential bilingual (L2) Turkish-English children comprehend English reflexives and pronouns and tests whether they pattern similarly to monolingual (L1) children, L2 adults, or children with Specific Language Impairment (SLI). Thirty nine 6- to 9-year-old L2 children with an age of onset of 30-48 months and exposure to English of 30-72 months and 33 L1 age-matched control children completed the Advanced Syntactic Test of Pronominal Reference-Revised (van der Lely, 1997). The L2 children’s performance was compared to L2 adults from Demirci (2001) and children with SLI from van der Lely & Stollwerck (1997). The L2 children’s performance in the comprehension of reflexives was almost identical to their age-matched controls, and differed from L2 adults and children with SLI. In the comprehension of pronouns, L2 children showed an asymmetry between referential and quantificational NPs, a pattern attested in younger L1 children and children with SLI. Our study provides evidence that the development of comprehension of reflexives and pronouns in these children resembles monolingual L1 acquisition and not adult L2 acquisition or acquisition of children with SLI.

Dynamic Changes in the Mental Rotation Network Revealed by Pattern Recognition Analysis of fMRI Data

We investigated the temporal dynamics and changes in connectivity in the mental rotation network through the application of spatio-temporal support vector machines (SVMs). The spatio-temporal SVM [Mourao-Miranda, J., Friston, K. J., et al. (2007). Dynamic discrimination analysis: A spatial-temporal SVM. Neuroimage, 36, 88-99] is a pattern recognition approach that is suitable for investigating dynamic changes in the brain network during a complex mental task. It does not require a model describing each component of the task and the precise shape of the BOLD impulse response. By defining a time window including a cognitive event, one can use spatio-temporal fMRI observations from two cognitive states to train the SVM. During the training, the SVM finds the discriminating pattern between the two states and produces a discriminating weight vector encompassing both voxels and time (i.e., spatio-temporal maps). We showed that by applying spatio-temporal SVM to an event-related mental rotation experiment, it is possible to discriminate between different degrees of angular disparity (0 degrees vs. 20 degrees, 0 degrees vs. 60 degrees, and 0 degrees vs. 100 degrees), and the discrimination accuracy is correlated with the difference in angular disparity between the conditions. For the comparison with highest accuracy (08 vs. 1008), we evaluated how the most discriminating areas (visual regions, parietal regions, supplementary, and premotor areas) change their behavior over time. The frontal premotor regions became highly discriminating earlier than the superior parietal cortex. There seems to be a parcellation of the parietal regions with an earlier discrimination of the inferior parietal lobe in the mental rotation in relation to the superior parietal. The SVM also identified a network of regions that had a decrease in BOLD responses during the 100 degrees condition in relation to the 0 degrees condition (posterior cingulate, frontal, and superior temporal gyrus). This network was also highly discriminating between the two conditions. In addition, we investigated changes in functional connectivity between the most discriminating areas identified by the spatio-temporal SVM. We observed an increase in functional connectivity between almost all areas activated during the 100 degrees condition (bilateral inferior and superior parietal lobe, bilateral premotor area, and SMA) but not between the areas that showed a decrease in BOLD response during the 100 degrees condition.

Network genealogy of 195-bp satellite DNA supports the superimposed hybridization hypothesis of Trypanosoma cruzi evolutionary pattern

Trypanosoma cruzi is highly diverse genetically and has been partitioned into six discrete typing units (DTUs), recently re-named T. cruzi I-VI. Although T. cruzi reproduces predominantly by binary division, accumulating evidence indicates that particular DTUs are the result of hybridization events. Two major scenarios for the origin of the hybrid lineages have been proposed. It is accepted widely that the most heterozygous TcV and TcVI DTUs are the result of genetic exchange between TcII and TcIII strains. On the other hand, the participation of a TcI parental in the current genome structure of these hybrid strains is a matter of debate. Here, sequences of the T. cruzi-specific 195-bp satellite DNA of TcI, TcII, Tat, TcV, and TcVI strains have been used for inferring network genealogies. The resulting genealogy showed a high degree of reticulation, which is consistent with more than one event of hybridization between the Tc DTUs. The data also strongly suggest that Tat is a hybrid with two distinct sets of satellite sequences, and that genetic exchange between TcI and TcII parentals occurred within the pedigree of the TcV and TcVI DTUs. Although satellite DNAs belong to the fast-evolving portion of eukaryotic genomes, in >100 satellite units of nine T. cruzi strains we found regions that display 100% identity. No DTU-specific consensus motifs were identified, inferring species-wide conservation. (C) 2010 Elsevier B.V. All rights reserved.