DOCSLIB.ORG

Austrian Journal of Statistics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Austrian Journal of Statistics Austrian Journal of Statistics AUSTRIAN STATISTICAL SOCIETY Volume 46, Number 3–4, 2017 ISSN: 1026597X, Vienna, Austria Österreichische Zeitschrift für Statistik ÖSTERREICHISCHE STATISTISCHE GESELLSCHAFT Austrian Journal of Statistics; Information and Instructions GENERAL NOTES The Austrian Journal of Statistics is an open-access journal with a long history and is published approx- imately quarterly by the Austrian Statistical Society. Its general objective is to promote and extend the use of statistical methods in all kind of theoretical and applied disciplines. Special emphasis is on methods and results in official statistics. Original papers and review articles in English will be published in the Austrian Journal of Statistics if judged consistently with these general aims. All papers will be refereed. Special topics sections will appear from time to time. Each section will have as a theme a specialized area of statistical application, theory, or methodology. Technical notes or problems for considerations under Shorter Communications are also invited. A special section is reserved for book reviews. All published manuscripts are available at http://www.ajs.or.at (old editions can be found at http://www.stat.tugraz.at/AJS/Editions.html) Members of the Austrian Statistical Society receive a copy of the Journal free of charge. To apply for a membership, see the website of the Society. Articles will also be made available through the web. PEER REVIEW PROCESS All contributions will be anonymously refereed which is also for the authors in order to getting positive feedback and constructive suggestions from other qualified people. Editor and referees must trust that the contribution has not been submitted for publication at the same time at another place. It is fair that the submitting author notifies if an earlier version has already been submitted somewhere before. Manuscripts stay with the publisher and referees. The refereeing and publishing in the Austrian Journal of Statistics is free of charge. The publisher, the Austrian Statistical Society requires a grant of copyright from authors in order to effectively publish and distribute this journal worldwide. OPEN ACCESS POLICY This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. ONLINE SUBMISSIONS Already have a Username/Password for Austrian Journal of Statistics? Go to http://www.ajs.or.at/index.php/ajs/login Need a Username/Password? Go to http://www.ajs.or.at/index.php/ajs/user/register Registration and login are required to submit items and to check the status of current submissions. AUTHOR GUIDELINES The original LATEX-file guidelinesAJS.zip (available online) should be used as a template for the setting up of a text to be submitted in computer readable form. Other formats are only accepted rarely. SUBMISSION PREPARATION CHECKLIST The submission has not been previously published, nor is it before another journal for consideration • (or an explanation has been provided in Comments to the Editor). The submission file is preferable in LAT Xfile format provided by the journal. • E All illustrations, figures, and tables are placed within the text at the appropriate points, rather than • at the end. The text adheres to the stylistic and bibliographic requirements outlined in the Author Guidelines, • which is found in About the Journal. COPYRIGHT NOTICE The author(s) retain any copyright on the submitted material. The contributors grant the journal the right to publish, distribute, index, archive and publicly display the article (and the abstract) in printed, electronic or any other form. Manuscripts should be unpublished and not be under consideration for publication elsewhere. By sub- mitting an article, the author(s) certify that the article is their original work, that they have the right to submit the article for publication, and that they can grant the above license. Austrian Journal of Statistics Volume 46, Number 3–4, 2017 Editor-in-chief: Matthias TEMPL http://www.ajs.or.at Published by the AUSTRIAN STATISTICAL SOCIETY http://www.osg.or.at Österreichische Zeitschrift für Statistik Jahrgang 46, Heft 3–4, 2017 ÖSTERREICHISCHE STATISTISCHE GESELLSCHAFT Impressum Editor: Matthias Templ, Statistics Austria & Vienna University of Technology Editorial Board: Peter Filzmoser, Vienna University of Technology Herwig Friedl, TU Graz Bernd Genser, University of Konstanz Peter Hackl, Vienna University of Economics, Austria Wolfgang Huf, Medical University of Vienna, Center for Medical Physics and Biomedical Engineering Alexander Kowarik, Statistics Austria, Austria Johannes Ledolter, Institute for Statistics and Mathematics, Wirtschaftsuniversität Wien & Management Sciences, University of Iowa Werner Mueller, Johannes Kepler University Linz, Austria Josef Richter, University of Innsbruck Milan Stehlik, Department of Applied Statistics, Johannes Kepler University, Linz, Austria Wolfgang Trutschnig, Department for Mathematics, University of Salzburg Regina Tüchler, Austrian Federal Economic Chamber, Austria Helga Wagner, Johannes Kepler University Walter Zwirner, University of Calgary, Canada Book Reviews: Ernst Stadlober, Graz University of Technology Printed by Statistics Austria, A-1110 Vienna Published approximately quarterly by the Austrian Statistical Society, C/o Statistik Austria Guglgasse 13, A–1110 Wien c Austrian Statistical Society Further use of excerpts only allowed with citation. All rights reserved. Contents Page Peter FILZMOSER, Yuriy KHARIN: Editorial . 1 Somnath DATTA: Robust Regression Analysis of Longitudinal Data under Cen- soring................................................................... 3 Alexander DÜRRE, Roland FRIED, Daniel VOGEL: The Spatial Sign Covari- ance Matrix and Its Application for Robust Correlation Estimation . 13 Alexey KHARIN, Ton That TU: Performance and Robustness Analysis of Se- quential Hypotheses Testing for Time Series with Trend . 23 Yuriy KHARIN, Michail MALTSEW: High-order Vector Markov Chain with Par- tial Connections in Data Analysis . 37 Vladimir MALUGIN, Alexander NOVOPOLTSEV: Statistical Estimation and Classification Algorithms for Regime-Switching VAR Model with Exogenous Variables. 47 Markus MATILAINEN, Jari MIETTINEN, Klaus NORDHAUSEN, Hannu OJA, Sara TASKINEN: On Independent Component Analysis with Stochastic Volatil- ity Models . 57 Yuliya MISHURA, Kostiantyn RALCHENKO, Sergiy SHKLYAR: Maximum Likelihood Drift Estimation for Gaussian Process with Stationary Increments . 67 Maria do Rosário OLIVEIRA, Margarida VILELA, Rui VALADAS, António PACHECO, Paulo SALVADOR: Extracting Information from Interval Data Us- ing Symbolic Principal Component Analysis. 79 Marina LERI, Yury PAVLOV: Random Graphs’ Robustness in Random Environ- ment.................................................................... 89 Georgy SHEVLYAKOV, Nikita VASILEVSKIY: A Modification of Linfoot’s Infor- mational Correlation Coefficient . 99 Eugenia STOIMENOVA: Comparison of Partially Ranked Lists . 107 OndˇrejVENCÁLEK: Depth-based Classification for Multivariate Data . 117 1 Editorial The Eleventh International Conference “Computer Data Analysis and Modeling: The- oretical and Applied Stochastics” (CDAM’2016) organized in Minsk by the Belarusian State University and Vienna University of Technology on September 6-10, 2016, was de- voted to the topical problems in computer data analysis and modeling. There were 83 presentations by more than 120 participants from 22 countries. The topics of the presentations corresponded to the following topical scientific prob- lems: robust and nonparametric data analysis; multivariate data analysis; statistical analy- sis of time series and stochastic processes; probabilistic and statistical analysis of discrete data; statistical signal and image processing; econometric and financial analysis and mod- eling; survey analysis and official statistics; computer simulation of stochastic systems; computer intensive methods, algorithms and statistical software; computer data analysis and statistical modeling in applications. This Special Issue contains 12 papers of the extended versions of the most significant presentations selected by the Organizing Committee after a refereeing process. List of referees K. Ducinskas, Klaipeda G. Dzemyda, Vilnius A. Egorov, Minsk P. Filzmoser, Vienna K. Fokianos, Nicosia Yu. Kharin, Minsk G. Medvedev, Minsk Yu. Mishura, Kyiv E. Orsingher, Rome G. Shevlyakov, St. Petersburg E. Zhuk, Minsk A. Zubkov, Moscow Both of us felt honored to be chosen as guest editors of this Special Issue of the Austri- an Journal of Statistics. We are grateful to all the people who contributed to this Special Issue: to the authors for submitting such interesting articles, to the reviewers for their valuable comments, and in particular to the editor-in-chief Matthias Templ for giving us this opportunity and for his help. We also would like to mention that the CDAM’2016 Conference was supported by the CDAMCSS Project within the OeAD’s programme IM- PULSE. Peter Filzmoser, Yuriy Kharin (Guest Editors) 2 Yuriy Kharin Research Institute for Applied Problems of Mathematics and Informatics Belarusian State University Independence av. 4 220030 Minsk, Belarus E-mail: [email protected] Peter Filzmoser Institute of Statistics and Mathematical Methods in Economics Vienna University of Technology Wiedner Hauptstr. 8–10 A-1040 Vienna, Austria E-mail: p.fi[email protected] Please note that all papers of this special issue
Load more

Recommended publications
  • Coding Theory, Information Theory and Cryptology : Proceedings of the EIDMA Winter Meeting, Veldhoven, December 19-21, 1994
    Coding theory, information theory and cryptology : proceedings of the EIDMA winter meeting, Veldhoven, December 19-21, 1994 Citation for published version (APA): Tilborg, van, H. C. A., & Willems, F. M. J. (Eds.) (1994). Coding theory, information theory and cryptology : proceedings of the EIDMA winter meeting, Veldhoven, December 19-21, 1994. Euler Institute of Discrete Mathematics and its Applications. Document status and date: Published: 01/01/1994 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Open Thesis-Cklee-Jul21.Pdf
    The Pennsylvania State University The Graduate School College of Engineering EFFICIENT INFORMATION ACCESS FOR LOCATION-BASED SERVICES IN MOBILE ENVIRONMENTS A Dissertation in Computer Science and Engineering by Chi Keung Lee c 2009 Chi Keung Lee Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy August 2009 The dissertation of Chi Keung Lee was reviewed and approved∗ by the following: Wang-Chien Lee Associate Professor of Computer Science and Engineering Dissertation Advisor Chair of Committee Donna Peuquet Professor of Geography Piotr Berman Associate Professor of Computer Science and Engineering Daniel Kifer Assistant Professor of Computer Science and Engineering Raj Acharya Professor of Computer Science and Engineering Head of Computer Science and Engineering ∗Signatures are on file in the Graduate School. Abstract The demand for pervasive access of location-related information (e.g., local traffic, restau- rant locations, navigation maps, weather conditions, pollution index, etc.) fosters a tremen- dous application base of Location Based Services (LBSs). Without loss of generality, we model location-related information as spatial objects and the accesses of such information as Location-Dependent Spatial Queries (LDSQs) in LBS systems. In this thesis, we address the efficiency issue of LDSQ processing through several innovative techniques. First, we develop a new client-side data caching model, called Complementary Space Caching (CSC), to effectively shorten data access latency over wireless channels. This is mo- tivated by an observation that mobile clients, with only a subset of objects cached, do not have sufficient knowledge to assert whether or not certain object access from the remote server are necessary for given LDSQs.
    [Show full text]
  • Checking Whether a Word Is Hamming-Isometric in Linear Time
    Checking whether a word is Hamming-isometric in linear time Marie-Pierre B´eal ID ,∗ Maxime Crochemore ID † July 26, 2021 Abstract duced Fibonacci cubes in which nodes are on a binary alphabet and avoid the factor 11. The notion of d- A finite word f is Hamming-isometric if for any two ary n-cubes has subsequently be extended to define word u and v of the same length avoiding f, u can the generalized Fibonacci cube [10, 11, 19] ; it is the 2 be transformed into v by changing one by one all the subgraph Qn(f) of a 2-ary n-cube whose nodes avoid letters on which u differs from v, in such a way that some factor f. In this framework, a binary word f is 2 all of the new words obtained in this process also said to be Lee-isometric when, for any n 1, Qn(f) 2 ≥ avoid f. Words which are not Hamming-isometric can be isometrically embedded into Qn, that is, the 2 have been characterized as words having a border distance between two words u and v vertices of Qn(f) 2 2 with two mismatches. We derive from this charac- is the same in Qn(f) and in Qn. terization a linear-time algorithm to check whether On a binary alphabet, the definition of a Lee- a word is Hamming-isometric. It is based on pat- isometric word can be equivalently given by ignor- tern matching algorithms with k mismatches. Lee- ing hypercubes and adopting a point of view closer isometric words over a four-letter alphabet have been to combinatorics on words.
    [Show full text]
  • Modern Techniques for Constraint Solving the Casper Experience
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by New University of Lisbon's Repository MARCO VARGAS CORREIA MODERN TECHNIQUES FOR CONSTRAINT SOLVING THE CASPER EXPERIENCE Dissertação apresentada para obtenção do Grau de Doutor em Engenharia Informática, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia. UNIÃO EUROPEIA Fundo Social Europeu LISBOA 2010 ii Acknowledgments First I would like to thank Pedro Barahona, the supervisor of this work. Besides his valuable scientific advice, his general optimism kept me motivated throughout the long, and some- times convoluted, years of my PhD. Additionally, he managed to find financial support for my participation on international conferences, workshops, and summer schools, and even for the extension of my grant for an extra year and an half. This was essential to keep me focused on the scientific work, and ultimately responsible for the existence of this dissertation. Designing, developing, and maintaining a constraint solver requires a lot of effort. I have been lucky to count on the help and advice of colleagues contributing directly or indirectly to the design and implementation of CASPER, to whom I am truly indebted: Francisco Azevedo introduced me to constraint solving over set variables, and was the first to point out the potential of incremental propagation. The set constraint solver integrating the work presented in this dissertation is based on his own solver CARDINAL, which he has thoroughly explained to me. Jorge Cruz was very helpful for clarifying many issues about real valued arithmetic, and propagation of constraints over real valued variables in general.
    [Show full text]
  • Download Book
    Lecture Notes in Computer Science 3279 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany Geoffrey M. Voelker Scott Shenker (Eds.) Peer-to-Peer Systems III Third International Workshop, IPTPS 2004 La Jolla, CA, USA, February 26-27, 2004 Revised Selected Papers 13 Volume Editors Geoffrey M. Voelker University of California, San Diego Department of Computer Science and Engineering 9500 Gilman Dr., MC 0114, La Jolla, CA 92093-0114, USA E-mail: [email protected] Scott Shenker University of California, Berkeley Computer Science Division, EECS Department 683 Soda Hall, 1776, Berkeley, CA 94720, USA E-mail: [email protected] Library of Congress Control Number: Applied for CR Subject Classification (1998): C.2.4, C.2, H.3, H.4, D.4, F.2.2, E.1, D.2 ISSN 0302-9743 ISBN 3-540-24252-X Springer Berlin Heidelberg New York This work is subject to copyright.
    [Show full text]
  • Anonymous Opt-Out and Secure Computation in Data Mining
    ANONYMOUS OPT-OUT AND SECURE COMPUTATION IN DATA MINING Samuel Steven Shepard A Thesis Submitted to the Graduate College of Bowling Green State University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE, MASTER OF ARTS December 2007 Committee: Ray Kresman, Advisor Larry Dunning So-Hsiang Chou Tong Sun ii ABSTRACT Ray Kresman, Advisor Privacy preserving data mining seeks to allow users to share data while ensuring individual and corpo- rate privacy concerns are addressed. Recently algorithms have been introduced to maintain privacy even when all but two parties collude. However, exogenous information and unwanted statistical disclosure can weaken collusion requirements and allow for approximation of sensitive information. Our work builds upon previous algorithms, putting cycle-partitioned secure sum into the mathematical framework of edge-disjoint Hamiltonian cycles and providing an additional anonymous “opt-out” procedure to help prevent unwanted statistical disclosure. iii Table of Contents CHAPTER 1: DATA MINING 1 1.1 The Basics . 1 1.2 Association Rule Mining Algorithms . 2 1.3 Distributed Data Mining . 3 1.4 Privacy-preserving Data Mining . 4 1.5 Secure Sum . 5 CHAPTER 2: HAMILTONIAN CYCLES 7 2.1 Graph Theory: An Introduction . 7 2.2 Generating Edge-disjoint Hamiltonian Cycles . 8 2.2.1 Fully-Connected . 8 2.2.2 Edge-disjoint Hamiltonian Cycles in Torus . 11 CHAPTER 3: COLLUSION RESISTANCE WITH OPT-OUT 14 3.1 Cycle-partitioned Secure Sum . 15 3.2 Problems with CPSS: Statistical Disclosure . 21 3.3 Anonymous Opt-Out . 22 3.4 Anonymous ID Assignment . 26 3.5 CPSS with Opt-out .
    [Show full text]
  • A Comparative Analysis of String Metric Algorithms
    International Journal of Latest Trends in Engineering and Technology Special Issue SACAIM 2017, pp. 138-142 e-ISSN:2278-621X A COMPARATIVE ANALYSIS OF STRING METRIC ALGORITHMS BabithaD’Cunha1, RoshiniKarishmaKarkada2 & Mrs.SuchethaVijaykumar3 Abstract: String metric is an important attribute for analysing a string pattern. A string metric provides a number indicating algorithm-specific indication distance. String metric includes many algorithms. One such algorithm is Levenshtein distance is a measure of the similarity between two strings, which we will refer to as the source string and the target string. Hamming distance algorithm is to find the distance between two strings of same length and the number of positions in which the corresponding symbols are different. Lee distance algorithm is used to state the number and length of disjoint paths between two nodes in a torus. We hereby propose to do a comparative study of all the above three algorithms by taking factors such as time and volume of the string to be searched and do an analysis of the same. Key Words: String Metric, Lee distance, Hamming distance,Levenshtein distance. 1. INTRODUCTION A string metric (also known as a string similarity metric or string distance function) is a metric that measures distance ("inverse similarity") between two text strings for approximate string matching. String matching is a technique to discover pattern from the specified input string. String matching algorithms are used to find the matches between the pattern and specified string. Various string matching algorithms are used to solve the string matching problems like wide window pattern matching, approximate string matching, polymorphic string matching, string matching with minimum mismatches, prefix matching, suffix matching, similarity measure etc.
    [Show full text]
  • A Study of Metrics of Distance and Correlation Between Ranked Lists
    A Study of Metrics of Distance and Correlation Between Ranked Lists for Compositionality Detection Christina Lioma and Niels Dalum Hansen Department of Computer Science, University of Copenhagen, Denmark Abstract Compositionality in language refers to how much the meaning of some phrase can be decomposed into the meaning of its constituents and the way these constituents are combined. Based on the premise that substitution by synonyms is meaning-preserving, compositionality can be approximated as the semantic similarity between a phrase and a version of that phrase where words have been replaced by their synonyms. Different ways of representing such phrases exist (e.g., vectors [1] or language models [2]), and the choice of representation affects the measurement of semantic similarity. We propose a new compositionality detection method that represents phrases as ranked lists of term weights. Our method approximatesthe semantic similarity between two ranked list representations using a range of well-known distance and correlation metrics. In contrast to most state-of-the-art approaches in compositionality detection, our method is completely unsupervised. Experiments with a publicly available dataset of 1048 human-annotatedphrases shows that, compared to strong supervised baselines, our approach provides superior measurement of compositionality using any of the dis- tance and correlation metrics considered. Keywords: Compositionality Detection, Metrics of Distance and Correlation 1. Introduction Compositionality in natural language describes the extent to which the meaning of a phrase can be decomposed into the meaning of its constituents and the way these arXiv:1703.03640v1 [cs.CL] 10 Mar 2017 constituents are combined. Automatic compositionality detection has long received attention (see, for instance, [1], [3], [4]).
    [Show full text]
  • Correcting Charge-Constrained Errors in the Rank-Modulation Scheme Anxiao (Andrew) Jiang, Member, IEEE, Moshe Schwartz, Member, IEEE, and Jehoshua Bruck, Fellow, IEEE
    2112 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 5, MAY 2010 Correcting Charge-Constrained Errors in the Rank-Modulation Scheme Anxiao (Andrew) Jiang, Member, IEEE, Moshe Schwartz, Member, IEEE, and Jehoshua Bruck, Fellow, IEEE Abstract—We investigate error-correcting codes for a the good performance [7]. To expand its storage capacity, research rank-modulation scheme with an application to flash memory on multilevel cells with large values of is actively underway. n devices. In this scheme, a set of cells stores information in the For flash memories, writing is more time- and energy-con- permutation induced by the different charge levels of the indi- vidual cells. The resulting scheme eliminates the need for discrete suming than reading [7]. The main factor is the iterative cell-pro- cell levels, overcomes overshoot errors when programming cells (a gramming procedure designed to avoid over-programming [2] serious problem that reduces the writing speed), and mitigates the (raising the cell’s charge level above its target level). In flash problem of asymmetric errors. In this paper, we study the proper- memories, cells are organized into blocks, where each block has ties of error-correcting codes for charge-constrained errors in the a large number of cells [7]. Cells can be programmed rank-modulation scheme. In this error model the number of errors corresponds to the minimal number of adjacent transpositions re- individually, but to decrease the state of a cell, the whole block quired to change a given stored permutation to another erroneous has to be erased to the lowest state and then re-programmed.
    [Show full text]
  • On Codes Over the Rings Fq + Ufq + Vfq + Uvfq
    The Islamic University of Gaza Deanery of Higher Studies Fuculty of Science Departemnt of Mathematics On Codes Over The Rings Fq + uFq + vFq + uvFq M.Sc. Thesis Presented by Ibrahim M. Yaghi Supervised by Dr. Mohammed M. AL-AShker Submitted in Partial Fulfillment of the Requirements for M.Sc. Degree 2013 Abstract Codes over finite rings have been studied in the early 1970's [4]. A great deal of attention has been given to codes over finite rings from 1990 [20], because of their new role in algebraic coding theory and their successful applications. In previous studies, some authors determined the structure of the ring F2 + uF2 + vF2 + 2 2 uvF2, where u = v = 0 and uv = vu, also they obtained linear codes, self dual codes, cyclic codes, and consta-cyclic codes over this ring as in [24],[25],[26],[27]. In this thesis, we aim to generalize the previous studies from the ring F2+uF2+vF2+uvF2 2 2 to the ring Fq + uFq + vFq + uvFq, where q is a power of the prime p and u = v = 0 uv = vu, so we obtain the linear codes over R = Fq + uFq + vFq + uvFq, then we investigate self dual codes over R and we find that it can be generalized only when q is a power of the prime 2, also we obtain cyclic and consta-cyclic codes over R, and we generalize the Gray map used for codes over F2 + uF2 + vF2 + uvF2, finally we obtain another gray map for codes over R. i Acknowledgements After Almighty Allah, I am grateful to my parents for their subsidization, patience, and love.
    [Show full text]
  • Needleman–Wunsch Algorithm
    Not logged in Talk Contributions Create account Log in Article Talk Read Edit View history Search Wikipedia Wiki Loves Love: Documenting festivals and celebrations of love on Commons. Help Wikimedia and win prizes by sending photos. Main page Contents Featured content Current events Needleman–Wunsch algorithm Random article From Wikipedia, the free encyclopedia Donate to Wikipedia Wikipedia store This article may be too technical for most readers to understand. Please help improve it Interaction to make it understandable to non-experts, without removing the technical details. (September 2013) (Learn how and when to remove this template message) Help About Wikipedia The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align Class Sequence Community portal protein or nucleotide sequences. It was one of the first applications of dynamic alignment Recent changes Worst-case performance Contact page programming to compare biological sequences. The algorithm was developed by Saul B. Needleman and Christian D. Wunsch and published in 1970.[1] The Worst-case space complexity Tools algorithm essentially divides a large problem (e.g. the full sequence) into a series of What links here smaller problems and uses the solutions to the smaller problems to reconstruct a solution to the larger problem.[2] It is also Related changes sometimes referred to as the optimal matching algorithm and the global alignment technique. The Needleman–Wunsch algorithm Upload file is still widely used for optimal global alignment, particularly when
    [Show full text]
  • Codes, Metrics, and Applications
    Codes, metrics, and applications Alexander Barg University of Maryland IITP RAS, Moscow ISIT 2016 Problems: § Distance distribution of codes § Duality of linear codes § Ordered linear codes and matroid invariants § Channel models matched to the ordered metrics; applications to polar codes, wiretap channels § Association schemes and bounds on the size of codes § Further extensions Acknowledgment: NSF grants CCF1217245 “Ordered metrics and their applications” CCF1422955, CCF0916919, CCF0807411 Talk summary Coding theory in a class of metric spaces: combinatorial and information-theoretic results and applications. § Channel models matched to the ordered metrics; applications to polar codes, wiretap channels § Association schemes and bounds on the size of codes § Further extensions Acknowledgment: NSF grants CCF1217245 “Ordered metrics and their applications” CCF1422955, CCF0916919, CCF0807411 Talk summary Coding theory in a class of metric spaces: combinatorial and information-theoretic results and applications. Problems: § Distance distribution of codes § Duality of linear codes § Ordered linear codes and matroid invariants Acknowledgment: NSF grants CCF1217245 “Ordered metrics and their applications” CCF1422955, CCF0916919, CCF0807411 Talk summary Coding theory in a class of metric spaces: combinatorial and information-theoretic results and applications. Problems: § Distance distribution of codes § Duality of linear codes § Ordered linear codes and matroid invariants § Channel models matched to the ordered metrics; applications to polar
    [Show full text]