reversal distances for strings with few blocks or small
play

Reversal Distances for Strings with Few Blocks or Small Alphabets - PowerPoint PPT Presentation

Dec 13, 2022 •148 likes •708 views

Introduction First results Fixed-parameter tractability Conclusion Reversal Distances for Strings with Few Blocks or Small Alphabets Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz Technische Universitt Berlin, Germany Universit

  1. Introduction First results Fixed-parameter tractability Conclusion Reversal Distances for Strings with Few Blocks or Small Alphabets Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz Technische Universität Berlin, Germany Université de Nantes, France Supported by the Alexander von Humboldt Fondation, Bonn, Germany, and by Région Pays de la Loire, France

  2. Introduction First results Fixed-parameter tractability Conclusion Introduction CPM, 2014-06-18 L. Bulteau 2/17

  3. Introduction First results Fixed-parameter tractability Conclusion Context Comparative genomics challenges: Understand history of genes Compute evolutionary tree Track small- or large-scale evolution events Understand interactions between genes and/or proteins etc. Genomes get rearranged progressively during evolution: cuts, duplications, reversals, etc. CPM, 2014-06-18 L. Bulteau 3/17

  4. Introduction First results Fixed-parameter tractability Conclusion Context Comparative genomics challenges: Understand history of genes Compute evolutionary tree Track small- or large-scale evolution events Understand interactions between genes and/or proteins etc. Genomes get rearranged progressively during evolution: cuts, duplications, reversals, etc. CPM, 2014-06-18 L. Bulteau 3/17

  5. Introduction First results Fixed-parameter tractability Conclusion Reversal Distance Reversal: genome rearrangement Reversal Distance: minimum number of reversals to go from one genome to an other CPM, 2014-06-18 L. Bulteau 4/17

  6. Introduction First results Fixed-parameter tractability Conclusion Reversal Distance Reversal: genome rearrangement Reversal Distance: minimum number of reversals to go from one genome to an other CPM, 2014-06-18 L. Bulteau 4/17

  7. Introduction First results Fixed-parameter tractability Conclusion Variants Signed Reversals: Prefix Reversals: CPM, 2014-06-18 L. Bulteau 5/17

  8. Introduction First results Fixed-parameter tractability Conclusion Blocks Block: maximum substring using only 1 letter Block in signed strings: strict ⇒ common sign free ⇒ may have different signs a a b a b b b c c a a c a a c CPM, 2014-06-18 L. Bulteau 6/17

  9. Introduction First results Fixed-parameter tractability Conclusion Blocks Block: maximum substring using only 1 letter Block in signed strings: strict ⇒ common sign free ⇒ may have different signs a a b a b b b c c a a c a a c CPM, 2014-06-18 L. Bulteau 6/17

  10. Introduction First results Fixed-parameter tractability Conclusion Blocks Block: maximum substring using only 1 letter Block in signed strings: strict ⇒ common sign free ⇒ may have different signs +a -a +b +a +b +b -b +b -b -b +a CPM, 2014-06-18 L. Bulteau 6/17

  11. Introduction First results Fixed-parameter tractability Conclusion Blocks Block: maximum substring using only 1 letter Block in signed strings: strict ⇒ common sign free ⇒ may have different signs +a -a +b +a +b +b -b +b -b -b +a CPM, 2014-06-18 L. Bulteau 6/17

  12. Introduction First results Fixed-parameter tractability Conclusion Blocks Block: maximum substring using only 1 letter Block in signed strings: strict ⇒ common sign free ⇒ may have different signs +a -a +b +a +b +b -b +b -b -b +a CPM, 2014-06-18 L. Bulteau 6/17

  13. Introduction First results Fixed-parameter tractability Conclusion Blocks Block: maximum substring using only 1 letter Block in signed strings: strict ⇒ common sign free ⇒ may have different signs +a -a +b +a +b +b -b +b -b -b +a Parameters b : maximum number of blocks in each input string | Σ | : alphabet size, | Σ | < b . CPM, 2014-06-18 L. Bulteau 6/17

  14. Introduction First results Fixed-parameter tractability Conclusion Blocks Block: maximum substring using only 1 letter Block in signed strings: strict ⇒ common sign free ⇒ may have different signs +a -a +b +a +b +b -b +b -b -b +a Parameters b : maximum number of blocks in each input string | Σ | : alphabet size, | Σ | < b . CPM, 2014-06-18 L. Bulteau 6/17

  15. Introduction First results Fixed-parameter tractability Conclusion Complexity of computing the reversal distance input / permutations strings strings with few blocks small reversals alphabet regular NP-hard P signed prefix signed prefix state of the art our contribution [Bafna, Pevzner ’96], [Christie ’98] CPM, 2014-06-18 L. Bulteau 7/17

  16. Introduction First results Fixed-parameter tractability Conclusion Complexity of computing the reversal distance input / permutations strings strings with few blocks small reversals alphabet regular NP-hard P signed NP-hard prefix signed prefix ? state of the art our contribution [Bulteau, Fertin, Rusu ’11] CPM, 2014-06-18 L. Bulteau 7/17

  17. Introduction First results Fixed-parameter tractability Conclusion Complexity of computing the reversal distance input / permutations strings strings with few blocks small reversals alphabet regular NP-hard NP-hard P NP-hard signed NP-hard NP-hard prefix signed prefix ? NP-hard state of the art our contribution [Christie ’98] [Radcliffe, Scott, Wilmer ’06] CPM, 2014-06-18 L. Bulteau 7/17

  18. Introduction First results Fixed-parameter tractability Conclusion Complexity of computing the reversal distance input / permutations strings strings with few blocks small reversals alphabet regular NP-hard NP-hard FPT P NP-hard signed NP-hard NP-hard FPT prefix signed prefix ? NP-hard state of the art our contribution FPT algorithm: O ((6 b ) 2 b n ) (constant | Σ | , reversal distance) b O ( b ) n (other cases) CPM, 2014-06-18 L. Bulteau 7/17

  19. Introduction First results Fixed-parameter tractability Conclusion Complexity of computing the reversal distance input / permutations strings strings with few blocks small reversals (strict) (free) alphabet regular NP-hard NP-hard FPT P NP-hard FPT signed NP-hard NP-hard FPT prefix signed prefix ? NP-hard FPT state of the art our contribution FPT algorithm: O ((6 b ) 2 b n ) (constant | Σ | , reversal distance) b O ( b ) n (other cases) CPM, 2014-06-18 L. Bulteau 7/17

  20. Introduction First results Fixed-parameter tractability Conclusion Complexity of computing the reversal distance input / permutations strings strings with few blocks small reversals (strict) (free) alphabet regular NP-hard NP-hard FPT P NP-hard FPT NP-hard signed NP-hard NP-hard FPT prefix signed prefix ? NP-hard FPT NP-hard state of the art our contribution FPT algorithm: O ((6 b ) 2 b n ) (constant | Σ | , reversal distance) b O ( b ) n (other cases) NP-hardness: even with b = | Σ | = 1 (unary alphabet) CPM, 2014-06-18 L. Bulteau 7/17

  21. Introduction First results Fixed-parameter tractability Conclusion Complexity of computing the reversal distance input / permutations strings strings with few blocks small reversals (strict) (free) alphabet regular NP-hard NP-hard FPT Exp. P NP-hard FPT NP-hard Exp. signed NP-hard NP-hard FPT Exp. prefix signed prefix ? NP-hard FPT NP-hard Exp. state of the art our contribution FPT algorithm: O ((6 b ) 2 b n ) (constant | Σ | , reversal distance) b O ( b ) n (other cases) NP-hardness: even with b = | Σ | = 1 (unary alphabet) Exact algorithm: | Σ | n poly ( n ) (unsigned) (2 | Σ | ) n poly ( n ) (signed) CPM, 2014-06-18 L. Bulteau 7/17

  22. Introduction First results Fixed-parameter tractability Conclusion Complexity of computing the reversal distance input / permutations strings strings with few blocks small reversals (strict) (free) alphabet regular NP-hard NP-hard FPT Exp. P NP-hard FPT NP-hard Exp. signed NP-hard NP-hard FPT Exp. prefix signed prefix ? NP-hard FPT NP-hard Exp. state of the art our contribution FPT algorithm: O ((6 b ) 2 b n ) (constant | Σ | , reversal distance) b O ( b ) n (other cases) NP-hardness: even with b = | Σ | = 1 (unary alphabet) Exact algorithm: | Σ | n poly ( n ) (unsigned) (2 | Σ | ) n poly ( n ) (signed) CPM, 2014-06-18 L. Bulteau 7/17

  23. Introduction First results Fixed-parameter tractability Conclusion First results CPM, 2014-06-18 L. Bulteau 8/17

  24. Introduction First results Fixed-parameter tractability Conclusion Preliminary result: diameter The reversal distance between two strings with ≤ b blocks is upper-bounded by: 2 b − | Σ | CPM, 2014-06-18 L. Bulteau 9/17

  25. Introduction First results Fixed-parameter tractability Conclusion Preliminary result: diameter The reversal distance between two strings with ≤ b blocks is upper-bounded by: 2 b − | Σ | → Obtained by: – grouping the blocks in each string into | Σ | bigger blocks ( b − | Σ | reversals for each side), – sorting the middle strings ( | Σ | reversals). CPM, 2014-06-18 L. Bulteau 9/17

  26. Introduction First results Fixed-parameter tractability Conclusion Small alphabet: exact algorithm The Reversal Distance with alphabet Σ can be computed in time | Σ | n poly ( n ) CPM, 2014-06-18 L. Bulteau 10/17

Recommend

The Closest Substring problem with small distances D aniel Marx dmarx@informatik.hu-berlin.de

The Closest Substring problem with small distances D aniel Marx dmarx@informatik.hu-berlin.de

The Closest Substring problem with small distances D aniel Marx dmarx@informatik.hu-berlin.de June 10, 2005 The Closest Substring problem with small distances p.1/28 The Closest String problem C LOSEST S TRING Strings s 1 , . . . , s k

536 views • 52 slides
String-brane interactions from large to small distances Giuseppe DAppollonio Universit` a di

String-brane interactions from large to small distances Giuseppe DAppollonio Universit` a di

String-brane interactions from large to small distances Giuseppe DAppollonio Universit` a di Cagliari and INFN DAMTP Cambridge Galileo Galilei Institute, Firenze, 10 April 2019 String-brane interactions from large to small distances

581 views • 38 slides
Reversal Distance for Strings with Duplicates 1 Petr Kolman 2 Tomek Wale 1 Faculty of Mathematics

Reversal Distance for Strings with Duplicates 1 Petr Kolman 2 Tomek Wale 1 Faculty of Mathematics

Reversal Distance for Strings with Duplicates 1 Petr Kolman 2 Tomek Wale 1 Faculty of Mathematics and Physics Charles University in Prague 2 Wydzia Matematyki, Informatyki i Mechaniki Warsaw University September 15, 2006 P. Kolman, T. Wale

588 views • 24 slides
ITC Reversal and RCM 24 th June 2020 Webinar, CTC CA Naresh Sheth CA Sanket Shah ITC Reversal

ITC Reversal and RCM 24 th June 2020 Webinar, CTC CA Naresh Sheth CA Sanket Shah ITC Reversal

GST for Real Estate ITC Reversal and RCM 24 th June 2020 Webinar, CTC CA Naresh Sheth CA Sanket Shah ITC Reversal under Rule 42 Projects completed till 31 st March 2019 Reversal applicable only in the year of completion or for full project

396 views • 25 slides
Basic concepts on magnetization reversal (1) Static properties : coherent reversal and beyond

Basic concepts on magnetization reversal (1) Static properties : coherent reversal and beyond

Basic concepts on magnetization reversal (1) Static properties : coherent reversal and beyond Stanislas ROHART Laboratoire de Physique des Solides Universit Paris Sud and CNRS Orsay, France Introduction: Hysteresis loop Manipulation of a

754 views • 38 slides
Chapter 9 Strings 1 C-Strings vs C++ Strings T wo string types: C-strings Array

Chapter 9 Strings 1 C-Strings vs C++ Strings T wo string types: C-strings Array

Chapter 9 Strings 1 C-Strings vs C++ Strings T wo string types: C-strings Array with base type char End of string marked with null, \0 Older method inherited from C C++ strings Objects of string class 2

469 views • 18 slides
State of Collaboration Check Reversal (AC 230) Workshop 1 1 AC-230 THE SALARY REVERSAL &amp;

State of Collaboration Check Reversal (AC 230) Workshop 1 1 AC-230 THE SALARY REVERSAL &amp;

State of Collaboration Check Reversal (AC 230) Workshop 1 1 AC-230 THE SALARY REVERSAL &amp; EXCHANGE PROCESS KEVIN CZMYR 2 2 What is an AC-230? Used to return salary checks for employees who have not earned their full salary due to:

1.88k views • 79 slides
Blocks What is syntax (delimiters) Where can blocks be used Scope and blocks Do

Blocks What is syntax (delimiters) Where can blocks be used Scope and blocks Do

Blocks What is syntax (delimiters) Where can blocks be used Scope and blocks Do blocks return a value (use in expressions) Entry point(s) to blocks Exit point(s) from blocks Block syntax and use Typically need start/stop

463 views • 5 slides
Strings Testing for equality with strings. Lexicographic ordering of strings. Other

Strings Testing for equality with strings. Lexicographic ordering of strings. Other

Strings Testing for equality with strings. Lexicographic ordering of strings. Other string methods. 1 Strings and Testing for Equality The == operator is also not appropriate for determining if two objects , such as strings, have

380 views • 13 slides
Python:Strings Strings

Python:Strings Strings

Python:Strings Strings Source:https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-0001-introduction-to-computer-science-and- programming-in-python-fall-2016/lecture-slides-code/ Strings String is a sequence of

293 views • 13 slides
Perfect Block Ciphers With Small Blocks Louis Granboulan 1 , 2 Thomas Pornin 3 1 cole Normale

Perfect Block Ciphers With Small Blocks Louis Granboulan 1 , 2 Thomas Pornin 3 1 cole Normale

Block ciphers with non-standard sizes Choosing uniformly a random permutation P ERMUTATOR Sampling following the Hypergeometric Distribution Security Analysis Perfect Block Ciphers With Small Blocks Louis Granboulan 1 , 2 Thomas Pornin 3 1

550 views • 23 slides
Geodesic distances and intrinsic distances on some fractal sets Masanori Hino (Kyoto Univ.)

Geodesic distances and intrinsic distances on some fractal sets Masanori Hino (Kyoto Univ.)

Geodesic distances and intrinsic distances on some fractal sets Masanori Hino (Kyoto Univ.) International Conference on Advances on Fractals and Related Topics Chinese University of Hong Kong, December 11, 2012 1/17 1. Introduction M : a

844 views • 40 slides
Jan 2013 Speed limit set at 20mph Small, self-contained area (~5x5 blocks or mile

Jan 2013 Speed limit set at 20mph Small, self-contained area (~5x5 blocks or mile

Jan 2013 Speed limit set at 20mph Small, self-contained area (~5x5 blocks or mile diameter) Announced with signage and gateways Self-enforcing via speed bumps 20mph markings remind drivers to slow down 2

363 views • 15 slides
Regexp Lecture 26: Regular Expressions Regular Expressions Regular expressions are a small

Regexp Lecture 26: Regular Expressions Regular Expressions Regular expressions are a small

Regexp Lecture 26: Regular Expressions Regular Expressions Regular expressions are a small programming language over strings Regex or regexp are not unique to Python They let us to succinctly and compactly represent classes of strings In this

739 views • 29 slides
Strings l Chapter 3s problem context is cryptography, but mostly it is about strings and

Strings l Chapter 3s problem context is cryptography, but mostly it is about strings and

Starting chapter 3 Strings l Chapter 3s problem context is cryptography, but mostly it is about strings and related ideas l Strings are basically sequences of characters l A string literal is enclosed in quotes ( '' or in Python):

292 views • 12 slides
ARM Assembler Strings Strings p. 1/16 Characters or Strings A string is a sequence of

ARM Assembler Strings Strings p. 1/16 Characters or Strings A string is a sequence of

Systems Architecture ARM Assembler Strings Strings p. 1/16 Characters or Strings A string is a sequence of characters ASCII 7-bit (American) character codes ( char ) One byte per character Unicode International character

901 views • 61 slides
Py Python Strings Python strings are immuatable: s = abc s[2] = d s = abd

Py Python Strings Python strings are immuatable: s = abc s[2] = d s = abd

2/25/20 CS 224 Introduction to Python Spring 2020 Class #14: Strings Py Python Strings Python strings are immuatable: s = abc s[2] = d s = abd These dont change the string abc s = s[:-1] + d they

444 views • 19 slides
The median problem for the reversal distance in circular bacterial genomes E. Ohlebusch, M.I.

The median problem for the reversal distance in circular bacterial genomes E. Ohlebusch, M.I.

Introduction Methods Conclusion The median problem for the reversal distance in circular bacterial genomes E. Ohlebusch, M.I. Abouelhoda, K. Hockel, J. Stallkamp University of Ulm, Germany CPM 2005 The median problem for the reversal

679 views • 31 slides
s[i] Introduction to Computer Programming Strings CSCI-UA 2 Strings and Characters Strings are

s[i] Introduction to Computer Programming Strings CSCI-UA 2 Strings and Characters Strings are

Introduction to Computer Programming Strings CSCI-UA 2 Strings and Characters s[i] Introduction to Computer Programming Strings CSCI-UA 2 Strings and Characters Strings are one of Pythons primary Strings data types Strings can be used

242 views • 10 slides
Listing Bit Strings List all bit strings of length 3. 000, 001, 010, 011, 100, 101, 110, 111.

Listing Bit Strings List all bit strings of length 3. 000, 001, 010, 011, 100, 101, 110, 111.

Listing Bit Strings List all bit strings of length 3. 000, 001, 010, 011, 100, 101, 110, 111. Now do it while only flipping one bit at a time! Today: Finish graphs and talk about numbers. Forests A forest is an acyclic graph. Each connected

534 views • 26 slides
Strings A string is an array of characters s = 'abc' MATLAB Strings is equivalent to s =

Strings A string is an array of characters s = 'abc' MATLAB Strings is equivalent to s =

Strings A string is an array of characters s = 'abc' MATLAB Strings is equivalent to s = [ 'a' 'b' 'c' ] All operations that apply to vectors and Selim Aksoy arrays can be used together with Bilkent University strings as well

39 views • 3 slides
Chapter 9: Strings (To avoid confusion, C-style strings will be referred to as C-string,

Chapter 9: Strings (To avoid confusion, C-style strings will be referred to as C-string,

Chapter 9: Strings (To avoid confusion, C-style strings will be referred to as C-string, regular C++ strings from the string class will be referred to as String). C-Strings Made up of character arrays that stores strings of

690 views • 3 slides
REVERSAL PROCESSING USING ILFORD BLACK &amp; WHITE FILMS TO MAKE MONOCHROME TRANSPARENCIES

REVERSAL PROCESSING USING ILFORD BLACK &amp; WHITE FILMS TO MAKE MONOCHROME TRANSPARENCIES

September 2003 APPLICATION SHEET REVERSAL PROCESSING USING ILFORD BLACK &amp; WHITE FILMS TO MAKE MONOCHROME TRANSPARENCIES REVERSAL PROCESSING OF ILFORD HEALTH AND SAFETY INFORMATION The processes mentioned in this leaflet suggest the

152 views • 4 slides
Strings, Languages, and Regular expressions Lecture 2 1 Strings 2 Definitions for strings

Strings, Languages, and Regular expressions Lecture 2 1 Strings 2 Definitions for strings

Strings, Languages, and Regular expressions Lecture 2 1 Strings 2 Definitions for strings e.g., = {0,1}, = { , , , } , = set of ascii characters alphabet = finite set of symbols string = finite

371 views • 36 slides

More recommend