Zugl. Kurzfassung von: Jena, Univ., Habil.-Schr., 2005

Thesis (Ph. D.)--University of Chicago. 1914. / Published also as Linguistic studies in Germanic, edited by E. A. Wood. no. III. Also available on the Internet.

University, Diss., 2001--Saarbrücken.

This diploma thesis focuses on the French analytic predicates with event nouns with the suffix -ation. It is divided into two parts, a theoretical and a practical one. The theoretical part starts with a description of the analytic predicates and their caracteristics on which are based the tests used for identification of this type of predicates. It is followed by the description and typologies of the event nouns which represent one of two fondamental constituents of the analytic predicates. Then the work deals the process of nominalization, and the importance of the delimitation, sense and characteristics of the French suffix -ation is highlighted. The practical part analyses the most frequent French event nouns with the suffix -ation. First of all, a sample of thirty most frequent French nouns in -ation is selected, then the ethymology of these nouns is researched and their action sens is tested. After that, this work treats the valency of the action nouns and their collocability with verbs.

O avanço tecnológico dos laboratórios de biologia molecular tem proporcionado um grande aumento no volume de seqüências de nucleotídeos armazenadas em bancos de dados biológicos, introduzindo o desafio de pesquisar eficientemente estes dados. Neste contexto, a árvore de sufixo é um método de acesso utilizado por muitas aplicações que envolvem pesquisa em dados biológicos. Entretanto, o custo de construção das árvores de sufixo é alto devido ao tamanho da estrutura de indexação gerado e à necessidade da árvore de sufixo caber em memória principal para ser construída com complexidade linear em relação ao tempo. Esta dissertação propõe o Perseus, uma nova técnica para tratar árvores de sufixo persistentes. A técnica Perseus apresenta os seguintes diferenciais. Ela introduz uma abordagem que realiza a construção de árvores de sufixo persistentes cujos tamanhos podem exceder a capacidade da memória principal. Além disso, ela provê um algoritmo que constrói árvores de sufixo por meio do particionamento destas árvores somente quando necessário. Esta construção também permite que o usuário escolha quais subseqüências de uma seqüência devem ser indexadas, de acordo com os requisitos particulares de suas aplicações. Por fim, a técnica proposta também introduz um algoritmo de casamento exato que permite a busca por uma seqüência de consulta em árvores de sufixo que podem estar particionadas. A validação do Perseus foi realizada por meio de testes de desempenho considerando genomas de vários organismos, os quais possuem diferentes ordens de magnitude de tamanho. Os resultados obtidos foram comparados com a técnica Trellis+, a qual representa o estado da arte nesta linha de pesquisa. Os testes indicaram que o Perseus construiu árvores de sufixo mais rapidamente do que o Trellis+, reduzindo o tempo total gasto na construção em até 24%. Perseus também criou árvores de sufixo mais compactas, atingindo uma redução média de 27% no espaço de memória secundária utilizado. Já com relação ao tempo total gasto no processamento de consultas, Perseus sempre produziu os melhores resultados, respondendo consultas em média 49% mais rápido do que o seu principal concorrente. Com relação à indexação de subseqüências escolhidas pelo usuário, comparando os resultados obtidos com o Trellis+, os testes mostraram que Perseus proveu uma redução no tempo de construção de árvores de sufixo de 97% na média e uma redução no tempo gasto no processamento de consultas de genes de 93% na média / Due to the technological advances in molecular biology laboratories, biological databases are extremely voluminous and tend to become more voluminous as data on new genome organisms are available. This introduces the challenge of searching nucleotide sequences efficiently. The suffix tree is an access method used for several applications that search for these data. However, the cost of building suffix trees is high, since they are extremely large data structures and they should fit in the main memory to be constructed in linear time. In this masters thesis, we propose the Perseus, a novel technique that handles persistent suffix trees. The Perseus introduces the following distinctive good properties. It is based on an approach that constructs persistent suffix trees whose sizes may exceed the main memory capacity. Furthermore, it provides an algorithm that allows for users to indicate which substrings of the input string should be indexed, according to the requirements of their applications. Moreover, it proposes an extended exact matching algorithm that searches for a query string into suffix trees that may be partitioned. The Perseus was validated through performance tests using genomes of several organisms of different sizes. The results were compared with the Trellis+ technique, which represents the state-of-the-art in this field. The tests showed that the Perseus reduced the time spent on constructing suffix trees by 24%. The Perseus also constructed compacter suffix trees, providing an average reduction in the secondary memory storage of 27%. Furthermore, the Perseus reduced the time spent on query processing of nucleotide sequences by up to 49%. As for the functionality of indexing substrings according to the users requirements, the Perseus greatly improved the query performance in comparison to the Trellis+. The results showed that the Perseus reduced the time spent on constructing suffix trees by 97% on average and the time spent on query processing of genes by 93% on average

The aim of this thesis is to create an algorithm that allows the alignment of the genome of two organisms by means of suffix structures and to implement it into the programming language environment R. The thesis deals with the description of the construction of the suffix structures and the methods of whole genome alignment. The result of the thesis is a functional algorithm for whole genome alignment by means of suffix structures implemented in the software environment R and its comparison with similar programs for the whole genome alignment.

No description available.

Indexing and processing strings are very important topics in database management. Strings can be database records, DNA sequences, protein sequences, or plain text. Various string operations are required for several application categories, such as bioinformatics and entity resolution. When the string count or sizes become very large, several state-of-the-art techniques for indexing and processing such strings may fail or behave very inefficiently. Modifying an existing technique to overcome these issues is not usually straightforward or even possible. A category of string operations can be facilitated by the suffix tree data structure, which basically indexes a long string to enable efficient finding of any substring of the indexed string, and can be used in other operations as well, such as approximate string matching. In this document, we introduce a novel efficient method to construct the suffix tree index for very long strings using parallel architectures, which is a major challenge in this category. Another category of string operations require clustering similar strings in order to perform application-specific processing on the resulting possibly-overlapping clusters. In this document, based on clustering similar strings, we introduce a novel efficient technique for record linkage and entity resolution, and a novel method for correcting errors in a large number of small strings (read sequences) generated by the DNA sequencing machines.

This thesis deals with functional equivalents of Italian adjectives with the suffix -bile in present-day Italian based on the Czech-Italian parallel linguistic corpus InterCorp. In the opening theoretical part the main objective of the thesis is introduced - a comparison of the Czech suffix -telný with the Italian suffix -bile. In the next chapters the thesis focuses on corpus material characteristics - on frequency list - from qualitative and quantitative aspects and on Czech equivalents' typology. The last part concentrates on statistical evaluation of Czech translation solutions, on the individual percentage representation of Czech equivalents' variants and on general trends while translating these adjectives with the suffix -bile into Czech.

Esta tese apresenta, por um lado, uma descrição sumária do funcionamento dos sufixos latinos -men e -mentum em relação à sua produção lexical, às suas características morfológicas e semânticas e a informação semântica estrutural de suas palavras derivadas, no Latim. Por outro, analisa, de modo exaustivo, como o sufixo -mentum desenvolveu-se nas principais línguas românicas: Castelhano, Francês, Italiano e Romeno, para poder contrastar com o Português. Apresentamos primeiramente uma proposta de origem para o sufixo latino - mentum, diferente da bibliografia existente sobre o assunto, que indica que -mentum advém de um alargamento de -men. Para isso, montamos um corpus de análise das palavras latinas, identificando as bases nominal e verbal das palavras em -men e em -mentum; em seguida, analisamos a datação dessas palavras para, ao final, verificar o significado do sufixo em cada uma delas, resultando numa proposta de genealogia dos sufixos -men / -mentum. Na segunda parte desta tese, apresentamos a derivação panromânica do sufixo latino -mentum. Montamos um corpus para cada língua pesquisada, de modo exaustivo, com indicação de data de entrada, étimo, origem e aspecto semântico. Em cada capítulo, analisamos todos os itens, exceto no Português, em que não realizamos pesquisa feita previamente em Freitas (2008), sobre a semântica dessas palavras. Em todas as línguas, propusemos uma árvore genealógica do sufixo estudado sob um aspecto semântico, mostrando o caminho feito pelo sufixo por meio de seus significados. Ao final, propomos um modelo de análise etimológica para as línguas românicas e uma genealogia do sufixo -mentum, do Latim às românicas. / This thesis presents, on the one hand, a brief description of the functioning of Latin suffixes -men and -mentum related to their lexical production, their morphological and semantic characteristics as well as the structural semantic information of their derived words in Latin. On the other hand, it analyses exhaustively the development of the suffix -mentum in the main Romance languages: Spanish, French, Italian and Romanian, so that we can contrast them with Portuguese. First, we present a proposal for the origins of the Latin suffix -mentum, different from the existing bibliography on the subject, which suggests that -mentum comes from an enlargement of -men. Thus, we have organised a corpus for the analysis of the Latin words, identifying the nominal and verbal bases of words ending in -men and -mentum; then, we analyse the datings of these words, so that we can verify the meaning of the suffix in each one of them, which results in a proposal for the genealogy of both suffixes -men / -mentum. In the second part of the thesis, we present the PanRomance derivation of Latin suffix -mentum. We have organized an exhaustive corpus for each language, indicating the first datings, etymon, origin and semantic aspect. In each chapter, we have analysed every item, but for Portuguese, in which we have not made the research previously presented in Freitas (2008) about the semantics of these words. For every language we have proposed a genealogical tree for the suffix, in its semantic aspect, showing the routes taken by the suffix through its meanings. Finally, we have proposed a model for etymological analysis for Romance languages, and a genealogy of the suffix -mentum, from Latin to Romance languages.