A Graph-Theoretic Barcode Ordering Model for Linked-Reads
暂无分享,去创建一个
Dominique Lavenier | Chen Sun | Cédric Chauve | Pierre Marijon | Rayan Chikhi | Yoann Dufresne | R. Chikhi | D. Lavenier | C. Chauve | Chen Sun | P. Marijon | Cédric Chauve | Y. Dufresne
[1] Michael C. Schatz,et al. LRSim: A Linked-Reads Simulator Generating Insights for Better Genome Partitioning , 2017, Computational and structural biotechnology journal.
[2] Iman Hajirasouliha,et al. Minerva: an alignment- and reference-free approach to deconvolve Linked-Reads for metagenomics. , 2019, Genome research.
[3] N. Weisenfeld,et al. Direct determination of diploid genome sequences , 2016, bioRxiv.
[4] Jay Shendure,et al. Haplotype phasing of whole human genomes using bead-based barcode partitioning in a single tube , 2017, Nature Biotechnology.
[5] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[6] Minghui Jiang,et al. Recognizing d-Interval Graphs and d-Track Interval Graphs , 2010, Algorithmica.
[7] Jian Wang,et al. Efficient and unique cobarcoding of second-generation sequencing reads from long DNA molecules enabling cost-effective and accurate sequencing, haplotyping, and de novo assembly , 2019, Genome research.
[8] Pinar Heggernes,et al. Interval Completion Is Fixed Parameter Tractable , 2008, SIAM J. Comput..
[9] Hanlee P. Ji,et al. Linked read sequencing resolves complex genomic rearrangements in gastric cancer metastases , 2017, Genome Medicine.
[10] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[11] Ron Shamir,et al. Realizing Interval Graphs with Size and Distance Constraints , 1997, SIAM J. Discret. Math..
[12] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..
[13] Pascal Ochem,et al. The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract) , 2012, WG.
[14] Pascal Ochem,et al. The Maximum Clique Problem in Multiple Interval Graphs , 2011, Algorithmica.
[15] Petr A. Golovach,et al. A survey of parameterized algorithms and the complexity of edge modification , 2020, Comput. Sci. Rev..
[16] David Coudert,et al. A note on Integer Linear Programming formulations for linear ordering problems on graphs , 2016 .
[17] Pierre Marijon,et al. yacrd and fpa: upstream tools for long-read genome assembly , 2019, bioRxiv.
[18] David B. Shmoys,et al. Recognizing graphs with fixed interval number is NP-complete , 1984, Discret. Appl. Math..
[19] Moshe Lewenstein,et al. Optimization problems in multiple-interval graphs , 2007, SODA '07.
[20] Justin Chu,et al. ARCS: scaffolding genome drafts with linked reads , 2017, Bioinform..
[21] Osamu Watanabe,et al. Interval graph representation with given interval and intersection lengths , 2012, J. Discrete Algorithms.
[22] Serafim Batzoglou,et al. High-quality genome sequences of uncultured microbes by assembly of read clouds , 2018, Nature Biotechnology.
[23] Sergey I. Nikolenko,et al. SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing , 2012, J. Comput. Biol..
[24] Ross M. McConnell. Linear-Time Recognition of Circular-Arc Graphs , 2003, Algorithmica.
[25] Mathieu Bastian,et al. Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.
[26] Reuven Bar-Yehuda,et al. Scheduling split intervals , 2002, SODA '02.
[27] Aric Hagberg,et al. Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.
[28] Ross McConnell. Linear-Time Recognition of Circular-Arc Graphs ; CU-CS-914-01 , 2001 .
[29] Yong Wang,et al. Ultra-low input single tube linked-read library method enables short-read NGS systems to generate highly accurate and economical long-range sequencing information for de novo genome assembly and haplotype phasing , 2019, bioRxiv.
[30] Akira Tanaka,et al. The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..
[31] Michal Pilipczuk,et al. Subexponential Parameterized Algorithm for Interval Completion , 2016, SODA.
[32] Sven Rahmann,et al. Genome analysis , 2022 .
[33] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[34] ZVI GALIL,et al. Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.