Linear time minimum segmentation enables scalable founder reconstruction

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

Результат исследований: Вклад в журналСтатьяНаучно-исследовательскаярецензирование

Язык оригиналаАнглийский
Номер статьи12
Число страниц15
ЖурналAlgorithms for Molecular Biology
Том14
Номер выпуска1
DOI
СостояниеОпубликовано - 17 мая 2019

Отпечаток

Chromosomes
Linear Time
Segmentation
Human Chromosomes
Haplotypes
Computational complexity
Haplotype
Polynomials
Chromosome
Genomics
Contiguity
Distinct
Formulation
NP-hard Problems
Preprocessing
Crossover
Polynomial time
Disjoint
Alignment
Strings

Ключевые слова

    Предметные области ASJC Scopus

    • Applied Mathematics
    • Molecular Biology
    • Structural Biology
    • Computational Theory and Mathematics

    Предметные области WoS

    • Биохимические методы исследований
    • Биотехнология и прикладная микробиология
    • Математическая и компьютерная биология

    Цитировать

    Norri, Tuukka ; Cazaux, Bastien ; Kosolobov, Dmitry ; Mäkinen, Veli. / Linear time minimum segmentation enables scalable founder reconstruction. В: Algorithms for Molecular Biology. 2019 ; Том 14, № 1.
    @article{acf43fea9c1346d89a440381fe8ee411,
    title = "Linear time minimum segmentation enables scalable founder reconstruction",
    keywords = "Dynamic programming, Founder reconstruction, Pan-genome indexing, Positional Burrows-Wheeler transform, Range minimum query, STORAGE, QUERIES, BURROWS-WHEELER TRANSFORM",
    author = "Tuukka Norri and Bastien Cazaux and Dmitry Kosolobov and Veli M{\"a}kinen",
    year = "2019",
    month = "5",
    day = "17",
    doi = "10.1186/s13015-019-0147-6",
    language = "English",
    volume = "14",
    journal = "Algorithms for Molecular Biology",
    issn = "1748-7188",
    publisher = "BioMed Central",
    number = "1",

    }

    Linear time minimum segmentation enables scalable founder reconstruction. / Norri, Tuukka; Cazaux, Bastien; Kosolobov, Dmitry; Mäkinen, Veli.

    В: Algorithms for Molecular Biology, Том 14, № 1, 12, 17.05.2019.

    Результат исследований: Вклад в журналСтатьяНаучно-исследовательскаярецензирование

    TY - JOUR

    T1 - Linear time minimum segmentation enables scalable founder reconstruction

    AU - Norri, Tuukka

    AU - Cazaux, Bastien

    AU - Kosolobov, Dmitry

    AU - Mäkinen, Veli

    PY - 2019/5/17

    Y1 - 2019/5/17

    KW - Dynamic programming

    KW - Founder reconstruction

    KW - Pan-genome indexing

    KW - Positional Burrows-Wheeler transform

    KW - Range minimum query

    KW - STORAGE

    KW - QUERIES

    KW - BURROWS-WHEELER TRANSFORM

    UR - http://www.scopus.com/inward/record.url?scp=85065895221&partnerID=8YFLogxK

    UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000468292600001

    U2 - 10.1186/s13015-019-0147-6

    DO - 10.1186/s13015-019-0147-6

    M3 - Article

    VL - 14

    JO - Algorithms for Molecular Biology

    JF - Algorithms for Molecular Biology

    SN - 1748-7188

    IS - 1

    M1 - 12

    ER -