Concepedia

String Reconstruction

String Reconstruction is a computational problem in string algorithms that involves inferring a unique or optimal original string from a given set of subsequences, fragments, or k-mers, distinguished by its focus on accurately restoring the source string under specific constraints and assembly rules.

39

Publications

1.9K

Citations

83

Authors

48

Institutions

Publications per year

2017–2026

17

Parents

Publications

39

Algorithms for Loop Matchings

Ruth Nussinov, George Pieczenik, Jerrold R. Griggs et al. · SIAM Journal on Applied Mathematics · 1978 · 603 citations

, , +12

Efficient Reconstruction of Sequences from Their Subsequences or Supersequences

V.I. Levenshtein · Journal of Combinatorial Theory Series A · 2001 · 182 citations

, , +5

Reconstructing Strings from Random Traces

London School of Economics and Political Science Research Online (London School of Economics and Political Science) · 2004 · 109 citations · Full text

, , +13

Trace reconstruction with constant deletion probability and related results

Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy‎ et al. · Symposium on Discrete Algorithms · 2008 · 82 citations

, , +10

Reconstructing strings from substrings in rounds

Dimosthenis Margaritis, Steven Skiena · 2002 · 67 citations

, , +11

1–5 of 39

Authors

83

  1. EY
    Eitan Yaakobi

    Technion – Israel Institute of Technology, Israel

    6 publications · 159 citations

    6

    h-index

  2. OM
    Olgica Milenković

    University of Illinois Urbana-Champaign, United States

    4 publications · 85 citations

    4

    h-index

  3. RA
    Rocco A. Servedio

    Columbia University, United States

    3 publications · 79 citations

    3

    h-index

  4. RG
    Ryan Gabrys

    Technion – Israel Institute of Technology, Israel

    3 publications · 65 citations

    3

    h-index

  5. RO
    Ryan O’Donnell

    Carnegie Mellon University, United States

    2 publications · 66 citations

    2

    h-index

1–5 of 83

Institutions

48

  1. Technion – Israel Institute of Technology

    Haifa, Israel

    6 h-index

    14 publications

    374 citations

  2. University of California San Diego

    San Diego, United States

    3 h-index

    6 publications

    112 citations

  3. Columbia University

    New York, United States

    3 h-index

    7 publications

    145 citations

  4. University of Illinois Urbana-Champaign

    Urbana, United States

    3 h-index

    7 publications

    154 citations

  5. Carnegie Mellon University

    Pittsburgh, United States

    2 h-index

    4 publications

    106 citations

  6. Tel Aviv University

    Tel Aviv, Israel

    2 h-index

    5 publications

    204 citations

  7. Centre National de la Recherche Scientifique

    Paris, France

    2 h-index

    3 publications

    58 citations

  8. Microsoft (United States)

    Redmond, United States

    2 h-index

    2 publications

    28 citations

1–8 of 48

Venues

  1. IEEE Transactions on Information Theory

    3 publications · 79 citations

    3

    h-index

  2. Symposium on Discrete Algorithms

    Conference · 2 publications · 127 citations

    2

    h-index

  3. Computer applications in the biosciences

    CABIOS · 2 publications · 39 citations

    2

    h-index

  4. Journal of Computational Biology

    2 publications · 86 citations

    2

    h-index

  5. Journal of Combinatorial Theory Series A

    2 publications · 245 citations

    2

    h-index

1–5