Business-IT alignment (BITA) has clearly become more important over the last decade. However, considerable difficulties remain when attempting to achieve a mature level of BITA. Therefore, research efforts which have resulted in a number of theoretical models have been able to help in devising and applying supportive tools for assessing different components of BITA. However, most of these efforts have either been produced in Anglo-Saxon countries or have been based on specific experiences in those countries. Consequently, they have tended to ignore a number of factors which differ in nature due to variations in cultural contexts. However, organisational culture has been given little consideration. Societal and organisational cultural aspects of BITA are particularly important because the majority of BITA models tend to focus more on the efficiency and effectiveness of BITA components rather than on trying to create ways in which how BITA can be achieved or maintained in different contexts. Therefore, the purpose of this thesis is to investigate the impact of societal and organisational culture on achieving BITA and influencing its maturity. The main result is an extended BITA model developed originally by Luftman, known as; Luftman’s Strategic Alignment Maturity Model (SAM), which is influenced by the organisational culture perspective. The research method and process advocated by Peffers et al. (2007) is used in the thesis to design the extended-SAM, consisting of six activities. The first of these activities involves identifying specific problems. This is achieved by an extensive literature survey of theories related to BITA, an explorative study of the impact of organisational culture on BITA and a classification of the general limitations of BITA. The second activity concerns the requirement for definitions of the designed artifact. The third activity is then specified in terms of designing the artifact; i.e. an extended-SAM. The design is based on constructed hypotheses of the potential impact of organisational culture elements (based on Smit et al.’s model (2008) on BITA attributes (based on SAM), and followed by an empirical study of 6 multinational organisations, for testing the hypotheses. Following that, in the fourth activity, various processes for extending SAM are demonstrated in different seminars within the IT management group at DSV, in conference papers and in different seminars of the Swedish research School of Management and Information Technology (MIT) (Forskarskolan Management och IT. In the fifth activity, the extended-SAM model is evaluated in 5 multinational organisations to test its practicality and utility. In the last activity, a journal paper (Paper III in the thesis) is presented to summarise all the processes. The communication is also carried out through pre-licentiate and the licentiate seminars. The extended-SAM shows in the result of the thesis that organisational culture is a clear factor that should be considered while assessing and studying BITA maturity. In addition, by considering organisational culture, assessing BITA is clearly shown as being more accurate and as reflecting a more detailed picture of the organisation’s BITA.

A comparação de sequências finitas é uma ferramenta que é utilizada para a solução de problemas em várias áreas. Comparamos sequências inferindo quais são as operações de edição de substituição, inserção e remoção de símbolos que transformam uma sequência em uma outra. As matrizes de pontuação são estruturas largamente utilizadas e que definem um custo para cada tipo de operação de edição. Uma matriz de pontuação G é indexada pelos símbolos do alfabeto. A entrada de G na linha A, coluna B mede o custo da operação de edição para substituir o símbolo A pelo símbolo B. As matrizes de pontuação induzem funções que atribuem uma pontuação para um conjunto de operações de edição. Algumas dessas funções para a comparação de duas e de várias sequências são estudadas nesta tese. Quando cada símbolo de cada sequência é editado exatamente uma vez para transformar uma sequência em outra, o conjunto de operações de edição pode ser representado por uma estrutura conhecida por alinhamento. Descrevemos uma estrutura para representar o conjunto de operações de edição que não pode ser representado por um alinhamento convencional e descrevemos um algoritmo para encontrar a pontuação de uma sequência ótima de operações de edição usando um algoritmo conhecido para encontrar a pontuação de um alinhamento convencional ótimo. Considerando três diferentes funções induzidas de pontuação, caracterizamos, para cada uma delas, a classe das matrizes para as quais as funções induzidas de pontuação são métricas nas sequências. Dadas duas matrizes de pontuação G e G\', dizemos que elas são equivalentes para uma dada função que é induzida por uma matriz de pontuação e que avalia a qualidade de um alinhamento se, para quaisquer dois alinhamentos A e B, vale o seguinte: o alinhamento A é ``melhor\'\' do que o alinhamento B considerando a matriz G se e somente se A é ``melhor\'\' do que o alinhamento B considerando a matriz G\'. Neste trabalho, determinamos condições necessárias e suficientes para que duas matrizes de pontuação sejam equivalentes. Finalmente, definimos três novos critérios para pontuar alinhamentos de várias sequências. Todos os critérios consideram o comprimento do alinhamento além das operações de edição por ele representadas. Para cada um dos critérios definidos,propomos um algoritmo e o problema de decisão correspondente mostramos ser NP-completo. / Comparison of finite sequences is a tool used to solve problems in several areas. In order to compare sequences, we infer which are the edit operations of substitution, insertion and deletion of symbols that transform one sequence into another. Scoring matrices are a widely used structure to define a cost for each type of edit operation. A scoring matrix G is indexed by symbols of an alphabet. The entry in G in row A and column B measures the cost of the edit operation for replacing symbol A by symbol B. Scoring matrices induce functions that assign a score for a set of edit operations. Some of these functions for comparing two and multiple sequences are studied in this thesis. If each symbol is edited exactly once for transforming a sequence into another, the set of edit operations can be represented by a structure called alignment. We describe a structure to represent the set of edit operations that cannot be represented by a conventional alignment and we design an algorithm to find the cost of an optimal sequence of edit operations by using a known algorithm to find the cost of an optimal alignment. Considering three different kinds of induced scoring functions, we characterize, for each one of them, the class of matrices for which the induced scoring functions are metrics on sequences. Given two scoring matrices G and G\', we say they are equivalent for a given function that is induced by a scoring matrix and that evaluates the quality of an alignment if, for any two alignments A and B of two sequences, we have the following: alignment A is ``better\'\' than B considering scoring matrix G if and only if A is ``better\'\' than B considering scoring matrix G\'. In this work, we determine necessary and sufficient conditions for scoring matrices to be equivalent. Finally, we define three new criteria for scoring alignments of several sequence. Every criterion considers the length of the alignment and the edit operations represented by it. An algorithm for each criterion is studied and the corresponding decision problem is shown to be NP-complete.

La pose d’une prothèse totale de genou (PTG) se fait selon la technique d’alignement mécanique (AM) qui corrige les déformations constitutionnelles du membre pour créer un membre rectiligne. La survie à long terme des implants est excellente mais les résultats fonctionnels sont décevants avec notamment de nombreux symptômes résiduels. Une nouvelle technique chirurgicale, l’alignement cinématique (AC), vise à rétablir l’anatomie constitutionnelle pré-arthrosique du genou, et permet une amélioration des résultats fonctionnels des PTG. Cette technique est actuellement réalisée avec des implants destinés à un positionnement mécanique, et qui ont un design trochléen ne reproduisant pas l'anatomie trochléaire native. Ceci pourrait affecter la biomécanique de l’articulation patello-fémorale et donc rendre les résultats fonctionnels des PTG cinématiques non optimal. Ce travail vise à démontrer 1) les limitations de la technique mécanique, 2) la fiabilité de la technique cinématique pour le positionnement de l’implant fémoral, et 3) que les implants actuels ne permettent pas une restauration de l’anatomie trochléenne des patients. / The conventional technique for TKA, namely mechanical alignment (MA), does not preserve the constitutional limb anatomy but systematically creates a straight limb. Excellent long-term implant survivorship has been reported, but functional outcomes are disappointing. To solve this problem, an alternative technique for TKA, namely kinematic alignment (KA), has recently been promoted and aims at restoring the constitutional (pre-arthritic) knee anatomy and laxity. Mid-term outcomes have shown excellent functional outcomes with this new KA technique. However, KA technique is currently done with TKA implants designed to be mechanically inserted. Their trochlea design does not reproduce the native trochlear anatomy, which could lead to increased rate of patellar complications with KA TKA. This work aims at demonstrating technical limitations of MA technique, good reproducibility of KA technique, and inappropriateness of current implant to restore patient trochlea anatomy.

A comparação de sequências finitas é uma ferramenta que é utilizada para a solução de problemas em várias áreas. Comparamos sequências inferindo quais são as operações de edição de substituição, inserção e remoção de símbolos que transformam uma sequência em uma outra. As matrizes de pontuação são estruturas largamente utilizadas e que definem um custo para cada tipo de operação de edição. Uma matriz de pontuação G é indexada pelos símbolos do alfabeto. A entrada de G na linha A, coluna B mede o custo da operação de edição para substituir o símbolo A pelo símbolo B. As matrizes de pontuação induzem funções que atribuem uma pontuação para um conjunto de operações de edição. Algumas dessas funções para a comparação de duas e de várias sequências são estudadas nesta tese. Quando cada símbolo de cada sequência é editado exatamente uma vez para transformar uma sequência em outra, o conjunto de operações de edição pode ser representado por uma estrutura conhecida por alinhamento. Descrevemos uma estrutura para representar o conjunto de operações de edição que não pode ser representado por um alinhamento convencional e descrevemos um algoritmo para encontrar a pontuação de uma sequência ótima de operações de edição usando um algoritmo conhecido para encontrar a pontuação de um alinhamento convencional ótimo. Considerando três diferentes funções induzidas de pontuação, caracterizamos, para cada uma delas, a classe das matrizes para as quais as funções induzidas de pontuação são métricas nas sequências. Dadas duas matrizes de pontuação G e G\', dizemos que elas são equivalentes para uma dada função que é induzida por uma matriz de pontuação e que avalia a qualidade de um alinhamento se, para quaisquer dois alinhamentos A e B, vale o seguinte: o alinhamento A é ``melhor\'\' do que o alinhamento B considerando a matriz G se e somente se A é ``melhor\'\' do que o alinhamento B considerando a matriz G\'. Neste trabalho, determinamos condições necessárias e suficientes para que duas matrizes de pontuação sejam equivalentes. Finalmente, definimos três novos critérios para pontuar alinhamentos de várias sequências. Todos os critérios consideram o comprimento do alinhamento além das operações de edição por ele representadas. Para cada um dos critérios definidos,propomos um algoritmo e o problema de decisão correspondente mostramos ser NP-completo. / Comparison of finite sequences is a tool used to solve problems in several areas. In order to compare sequences, we infer which are the edit operations of substitution, insertion and deletion of symbols that transform one sequence into another. Scoring matrices are a widely used structure to define a cost for each type of edit operation. A scoring matrix G is indexed by symbols of an alphabet. The entry in G in row A and column B measures the cost of the edit operation for replacing symbol A by symbol B. Scoring matrices induce functions that assign a score for a set of edit operations. Some of these functions for comparing two and multiple sequences are studied in this thesis. If each symbol is edited exactly once for transforming a sequence into another, the set of edit operations can be represented by a structure called alignment. We describe a structure to represent the set of edit operations that cannot be represented by a conventional alignment and we design an algorithm to find the cost of an optimal sequence of edit operations by using a known algorithm to find the cost of an optimal alignment. Considering three different kinds of induced scoring functions, we characterize, for each one of them, the class of matrices for which the induced scoring functions are metrics on sequences. Given two scoring matrices G and G\', we say they are equivalent for a given function that is induced by a scoring matrix and that evaluates the quality of an alignment if, for any two alignments A and B of two sequences, we have the following: alignment A is ``better\'\' than B considering scoring matrix G if and only if A is ``better\'\' than B considering scoring matrix G\'. In this work, we determine necessary and sufficient conditions for scoring matrices to be equivalent. Finally, we define three new criteria for scoring alignments of several sequence. Every criterion considers the length of the alignment and the edit operations represented by it. An algorithm for each criterion is studied and the corresponding decision problem is shown to be NP-complete.

Aligner des macromolécules telles que des protéines, des ADN et des ARN afin de révéler ou exploiter, leur homologie fonctionnelle est un défi classique en bioinformatique, qui offre de nombreuses applications, notamment dans la modélisation de structures et l'annotation des génomes. Un certain nombre d'algorithmes et d'outils ont été proposés pour le problème d'alignement structure-séquence d'ARN. Cependant, en ce qui concerne les ARN complexes, comportant des pseudo-noeuds, des interactions multiples et des paires de bases non canoniques, de tels outils sont rarement utilisés dans la pratique, en partie à cause de leurs grandes exigences de calcul, et de leur incapacité à supporter des types généraux de structures. Récemment, Rinaudo et al. ont donné un algorithme paramétré général pour la comparaison structure-séquence d'ARN, qui est capable de prendre en entrée n'importe quel type de structures comportant des pseudo-noeuds. L'algorithme paramétré est un algorithme de programmation dynamique basée sur la décomposition arborescente. Nous avons développé plusieurs variantes et extensions de cet algorithme. Afin de l'accélérer sans perte sensible de précision, nous avons introduit une approche de programmation dynamique par bandes. De plus, trois algorithmes ont été développés pour obtenir des alignements sous-optimaux. De plus, nous introduisons dans ce contexte la notion de MEA (Maximum-expected Structure-Alignment) pour calculer un alignement avec la précision maximale attendue sur un ensemble d'alignements. Tous ces algorithmes ont été implémentés dans un logiciel nommé LiCoRNA (aLignment of Complex RNAs). Les performances de LiCoRNA ont été évaluées d'abord sur l'alignement des graines des familles de de la base de données RFAM qui comportent des pseudo-noeuds. Comparé aux autres algorithmes de l'état de l'art, LiCoRNA obtient généralement des résultats équivalents ou meilleurs que ses concurrents. Grâce à la grande précision démontrée par LiCoRNA, nous montrons que cet outil peut être utilisé pour améliorer les alignements de certaines familles de RFAM qui comportent des pseudo-noeuds. / Aligning macromolecules such as proteins, DNAs and RNAs in order to reveal, or conversely exploit, their functional homology is a classic challenge in bioinformatics, with far-reaching applications in structure modelling and genome annotation. In the specific context of complex RNAs, featuring pseudoknots, multiple interactions and non-canonical base pairs, multiple algorithmic solutions and tools have been proposed for the structure sequence alignment problem. However, such tools are seldom used in practice, due in part to their extreme computational demands, and because of their inability to support general types of structures. Recently, Rinaudo et al. gave a fully general parameterised algorithm for structure-sequence comparison, which is able to take as input any type of pseudoknotted structures. The parameterised algorithm is a tree decomposition based dynamic programming. To accelerate the dynamic programming algorithm without losing two much accuracy, we introduced a banded dynamic programming. Then three algorithms are introduced to get the suboptimal structure-sequence alignments. Furthermore, we introduce the notation Maximum Expected structure-sequence Alignment (MEA) to compute an alignment with maximum expected accuracy over a set of alignments. The Boltzmann match probability are computed based on the inside-outside algorithm. The algorithms are implemented in a software named LiCoRNA (aLignment of Complex RNAs). We first evaluate the performance of LiCoRNA on the seed alignment in the pseudoknotted RFAM families. Compared to the state-of-the-art algorithms, LiCoRNA shows generally equivalent or better results than its competitors. With the high accuracy showed by LiCoRNA, we further curate RFAM full pseudoknotted alignment. The reason why we realign full alignments is that covariance model does not support pseudoknot which may lead to misalign when building the full alignment.

En linguistique informatique, la relation entre langues différentes est souventétudiée via des techniques d'alignement automatique. De tels alignements peuvent êtreétablis à plusieurs niveaux structurels. En particulier, les alignements debi-textes aux niveaux phrastiques et sous-phrastiques constituent des sources importantesd'information dans pour diverses applications du Traitement Automatique du Language Naturel (TALN)moderne, la Traduction Automatique étant un exemple proéminent.Cependant, le calcul effectif des alignements de bi-textes peut êtreune tâche compliquée. Les divergences entre les langues sont multiples,de la structure de discours aux constructions morphologiques.Les alignements automatiques contiennent, majoritairement, des erreurs nuisantaux performances des applications.Dans cette situation, deux pistes de recherche émergent. La première est de continuerà améliorer les techniques d'alignement.La deuxième vise à développer des mesures de confiance fiables qui permettent aux applicationsde sélectionner les alignements selon leurs besoins.Les techniques d'alignement et l'estimation de confiance peuvent tous les deuxbénéficier d'alignements manuels.Des alignements manuels peuventjouer un rôle de supervision pour entraîner des modèles, et celuides données d'évaluation. Pourtant, la création des telles données est elle-mêmeune question importante, en particulier au niveau sous-phrastique, où les correspondancesmultilingues peuvent être implicites et difficiles à capturer.Cette thèse étudie des moyens pour acquérir des alignements de bi-textes utiles, aux niveauxphrastiques et sous-phrastiques. Le chapitre 1 fournit une description de nos motivations,la portée et l'organisation du travail, et introduit quelques repères terminologiques et lesprincipales notations.L'état-de-l'art des techniques d'alignement est revu dans la Partie I. Les chapitres 2 et3 décriventles méthodes respectivement pour l'alignement des phrases et des mots.Le chapitre 4 présente les bases de données d'alignement manuel,et discute de la création d'alignements de référence. Le reste de la thèse, la Partie II,présente nos contributions à l'alignement de bi-textes, en étudiant trois aspects.Le chapitre 5 présente notre contribution à la collection d'alignements de référence. Pourl'alignement des phrases, nous collectons les annotations d'un genre spécifiquede textes: les bi-textes littéraires. Nous proposons aussi un schéma d'annotation deconfiance. Pour l'alignement sous-phrastique,nous annotons les liens entre mots isolés avec une nouvelle catégorisation, et concevonsune approche innovante de segmentation itérative pour faciliter l'annotation des liens entre groupes de mots.Toutes les données collectées sont disponibles en ligne.L'amélioration des méthodes d'alignement reste un sujet important de la recherche. Nousprêtons une attention particulière à l'alignement phrastique, qui est souvent le point dedépart de l'alignement de bi-textes. Le chapitre 6 présente notre contribution. En commençantpar évaluer les outils d'alignement d'état-de-l'art et par analyser leurs modèles et résultats,nous proposons deux nouvelles méthodes pour l'alignement phrastique, qui obtiennent desperformances d'état-de-l'art sur un jeu de données difficile.L'autre sujet important d'étude est l'estimation de confiance. Dans le chapitre 7, nousproposons des mesures de confiance pour les alignements phrastique et sous-phrastique.Les expériences montrent que l'estimation de confiance des liens d'alignement reste undéfi remarquable. Il sera très utile de poursuivre cette étude pour renforcer les mesuresde confiance pour l'alignement de bi-textes.Enfin, notons que les contributions apportées dans cette thèse sont employées dans uneapplication réelle: le développement d'une liseuse qui vise à faciliter la lecturedes livres électroniques multilingues. / In computational linguistics, the relation between different languages is often studied through automatic alignment techniques. Such alignments can be established at various structural levels. In particular, sentential and sub-sentential bitext alignments constitute an important source of information in various modern Natural Language Processing (NLP) applications, a prominent one being Machine Translation (MT).Effectively computing bitext alignments, however, can be a challenging task. Discrepancies between languages appear in various ways, from discourse structures to morphological constructions. Automatic alignments would, at least in most cases, contain noise harmful for the performance of application systems which use the alignments. To deal with this situation, two research directions emerge: the first is to keep improving alignment techniques; the second is to develop reliable confidence measures which enable application systems to selectively employ the alignments according to their needs.Both alignment techniques and confidence estimation can benefit from manual alignments. Manual alignments can be used as both supervision examples to train scoring models and as evaluation materials. The creation of such data is, however, an important question in itself, particularly at sub-sentential levels, where cross-lingual correspondences can be only implicit and difficult to capture.This thesis focuses on means to acquire useful sentential and sub-sentential bitext alignments. Chapter 1 provides a non-technical description of the research motivation, scope, organization, and introduces terminologies and notation. State-of-the-art alignment techniques are reviewed in Part I. Chapter 2 and 3 describe state-of-the-art methods for respectively sentence and word alignment. Chapter 4 summarizes existing manual alignments, and discusses issues related to the creation of gold alignment data. The remainder of this thesis, Part II, presents our contributions to bitext alignment, which are concentrated on three sub-tasks.Chapter 5 presents our contribution to gold alignment data collection. For sentence- level alignment, we collect manual annotations for an interesting text genre: literary bitexts, which are very useful for evaluating sentence aligners. We also propose a scheme for sentence alignment confidence annotation. For sub-sentential alignment, we annotate one-to-one word links with a novel 4-way labelling scheme, and design a new approachfor facilitating the collection of many-to-many links. All the collected data is released on-line.Improving alignment methods remains an important research subject. We pay special attention to sentence alignment, which often lies at the beginning of the bitext alignment pipeline. Chapter 6 presents our contributions to this task. Starting by evaluating state-of-the-art aligners and analyzing their models and results, we propose two new sentence alignment methods, which achieve state-of-the-art performance on a difficult dataset.The other important subject that we study is confidence estimation. In Chapter 7, we propose confidence measures for sentential and sub-sentential alignments. Experiments show that confidence estimation of alignment links is a challenging problem, and more works on enhancing the confidence measures will be useful.Finally, note that these contributions have been employed in a real world application: the development of a bilingual reading tool aimed at facilitating the reading in a foreign language.

Heparan sulfate Proteoglycans (HSPG) are ubiquitous molecules with indispensable functions in various biological processes. Glypicans are a family of HSPG’s, characterized by a Gpi-anchor which directs them to the cell surface and/or extracellular matrix where they regulate growth factor signaling during development and disease. We report the identification and expression pattern of glypican genes from zebrafish. The zebrafish genome contains 10 glypican homologs, as opposed to six in mammals, which are highly conserved and are phylogenetically related to the mammalian genes. Some of the fish glypicans like Gpc1a, Gpc3, Gpc4, Gpc6a and Gpc6b show conserved synteny with their mammalian cognate genes. Many glypicans are expressed during the gastrulation stage, but their expression becomes more tissue specific and defined during somitogenesis stages, particularly in the developing central nervous system. Existence of multiple glypican orthologs in fish with diverse expression pattern suggests highly specialized and/or redundant function of these genes during embryonic development.

Ontology Matching is one of the hottest topic within the Semantic Web of recent years. There is still ample of space for improvement in terms of performance. Furthermore, current ontology matchers mostly concentrate on simple entity to entity matching. However, matching of whole structures could bring some additional complex relationships. These structures of ontologies can be captured as ontology patterns. The main theme of this thesis is an examination of pattern-based ontology matching enhanced with ontology transformation and pattern-based ontology alignment evaluation. The former is examined due to its potential benefits regarding complex matching and matching as such. The latter is examined because complex hypotheses could be beneficial feedback as complement to traditional evaluation methods. These two tasks are related to four different topics: ontology patterns, ontology transformation, ontology alignment evaluation and ontology matching. With regard to those four topics, this work covers the following aspects: * Examination of different aspects of ontology patterns. Particularly, description of relevant ontology patterns for ontology transformation and for ontology matching (such as naming, matching and transformation patterns). * Description of a pattern-based method for ontology transformation. * Introduction of new methods for an alignment evaluation; including using patterns as a complex structures for more detailed analysis. * Experiments and demonstrations of new concepts introduced in this thesis. The thesis first introduces naming pattern and matching pattern classification on which ontology transformation framework is based. Naming patterns are useful for detection of ontology patterns and for generation of new names for entities. Matching patterns are basis for transformation patterns in terms of sharing some building blocks. In comparison with matching patterns, transformation patterns have transformation links that represent way how parts of ontology patterns are transformed. Besides several evaluations and implementations, the thesis provides a demonstration of getting complex matching due to ontology transformation process. Ontology transformation framework has been implemented in Java environment where all generic patterns are represented as corresponding Java objects. Three main implemented services are made generally available as RESTful services: ontology pattern detection, transformation instruction generation and ontology transformation.

This study was focused on cattle body orientation in a new pasture environment. Environmental conditions that could affect orientation were also evaluated. Data were collected by direct observation of three groups of cattle for three days from 7:00 to 19:00 each hour. Photographs of individuals were taken and the direction to north was determined using a compass. Simultaneously, meteorological data (temperature, relative humidity, wind direction and velocity, precipitation) were also recorded each hour.

Syfte: Syftet är att undersöka överensstämmelse avseende mål och motivationsfaktorer mellan samarbetande organisationer. Syftet är även att undersöka hur denna överensstämmelse samt identifierade mål och motivationsfaktorer kan bidra till en ersättningsmodell som främjar en bra transporttjänst. Design och metoder: Denna studie har genomförts som en fallstudie där samarbetet mellan ett speditionsföretag och två åkerier varit i fokus. Som metod för datainsamling till fallstudien användes en kombination av semistrukturerade intervjuer och rangordningstabeller. Till analysen av det empiriska materialet hämtades inspiration från flera olika metoder, dels hämtades inspiration från den tematiska analysmetoden men även från aktiviteterna sortera, reducera och argumentera. Slutligen användes även aktiviteten jämförelse för att kunna analysera överensstämmelsen mellan speditionsföretaget och åkerierna. Resultat: Resultatet gällande målöverensstämmelsen visade att åkerierna hade en begränsad kännedom om speditionsföretagets uttalade mål vilket i detta fall likställs med ingen till låg överensstämmelse. En större överensstämmelse identifierades dock avseende områdena förväntningar och framtida mål. Gällande motivationsöverensstämmelsen framkom det att speditionsföretaget hade en begränsad kännedom om vad som motiverar åkerierna, chaufförerna och transportplanerarna vilket innebär att överensstämmelsen därmed kan anses som låg. Resultatet visade även att en prestationsbaserad ersättningsmodell i tre nivåer bör möjliggöra för en högre måluppfyllnad och kunna leda till högre motivation. Bidrag: Studien har i viss mån bidragit till en utvecklad förståelse för hur olika parter i samarbetande organisationer uppfattar mål och förväntningar från den beställande parten och motivation hos den levererande parten. Vidare har studien bidragit med ett förslag på en ersättningsmodell bestående av tre prestationsbaserade ersättningsnivåer där olika mål är kopplade till respektive nivå. Begränsningar och framtida forskning: Den horisontella överensstämmelsen mellan samarbetande organisationer inom transportbranschen har visat sig vara mycket komplex och svårt att skapa en helhetsbild kring. Generaliserbarheten av resultaten till andra samarbetande organisationer anses utifrån det som relativt låg. Fortsatta studier föreslås inom området horisontell överensstämmelse, främst mellan samarbetande organisationer. En intressant inriktning kan då vara att undersöka om den horisontella överensstämmelsen mellan samarbetande organisationer kan ge samma positiva resultat avseende organisationers effektivitet och resultat som andra typer av överensstämmelse. Ett behov har även identifierats i form av att kunna namnge samarbetet mellan speditionsföretaget och åkerierna, vilket även det rekommenderas som ett område för fortsatt forskning. / Purpose: The purpose of this study is to investigate the alignment regarding goals and motivation factors between cooperating organizations. The purpose is also to investigate how this alignment, as well as identified goals and motivation factors, can contribute to a transaction model that promotes a good transport service. Design and methods: This study has been carried out as a case study where the cooperation between a forwarding company and two road haulage contractors has been in focus. As a method for data collection for the case study a combination of semi-structured interviews and ranking tables was used. The analysis of the empirical material was inspired by several different methods. Firstly, inspiration was derived from the thematic analysis method but also from the activities sorting, reducing and arguing. Finally, comparison was used to analyze the alignment between the forwarding company and the road haulage contractors. Result: The result regarding the goal alignment showed that the road haulage contractors had a limited knowledge of the forwarding company's stated goals, which in this case is equated with a low alignment. However, greater alignment was identified regarding the areas of expectations and future goals. Regarding the motivation alignment it emerged that the forwarding company had a limited knowledge of what motivates the road haulage contractors, the chauffeurs and the transport planners, which means that the alignment can be considered low. The result also showed that a performance-based transaction model in three levels might improve both goal fulfillment and contribute to higher motivation. Contributions: The study has to some extent contributed to a developed understanding of how different parties in cooperating organizations perceive goals and motivation. Further contributions are the suggested transaction model consisting of three performance-based levels where different goals are linked to each level. Restrictions and future research: The horizontal alignment between cooperating organizations in the transport sector has proved to be very complex and difficult to create an overall picture about. The generalisability of the results to other cooperating organizations is considered relatively low. Continued studies are proposed in the field of horizontal alignment, primarily between cooperating organizations. An interesting approach may then be to investigate whether the horizontal correspondence between cooperating organizations can yield the same positive results regarding organizations' effectiveness and results as other types of alignment. A need has also been identified in the form of being able to name the cooperation between the forwarding company and the road haulage contractors, which is also recommended as an area for continued research.