117 related articles for article (PubMed ID: 37292475)
1. Revisiting the Complexity of and Algorithms for the Graph Traversal Edit Distance and Its Variants.
Qiu Y; Shen Y; Kingsford C
ArXiv; 2023 Nov; ():. PubMed ID: 37292475
[TBL] [Abstract][Full Text] [Related]
2. Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants.
Qiu Y; Shen Y; Kingsford C
Algorithms Mol Biol; 2024 Apr; 19(1):17. PubMed ID: 38679703
[TBL] [Abstract][Full Text] [Related]
3. Graph Traversal Edit Distance and Extensions.
Ebrahimpour Boroojeny A; Shrestha A; Sharifi-Zarchi A; Gallagher SR; Sahinalp SC; Chitsaz H
J Comput Biol; 2020 Mar; 27(3):317-329. PubMed ID: 32058803
[No Abstract] [Full Text] [Related]
4. PyGTED: Python Application for Computing Graph Traversal Edit Distance.
Ebrahimpour Boroojeny A; Shrestha A; Sharifi-Zarchi A; Gallagher SR; Sahinalp SC; Chitsaz H
J Comput Biol; 2020 Mar; 27(3):436-439. PubMed ID: 32160033
[No Abstract] [Full Text] [Related]
5. The effect of genome graph expressiveness on the discrepancy between genome graph distance and string set distance.
Qiu Y; Kingsford C
Bioinformatics; 2022 Jun; 38(Suppl 1):i404-i412. PubMed ID: 35758819
[TBL] [Abstract][Full Text] [Related]
6. On the Hardness of Sequence Alignment on De Bruijn Graphs.
Gibney D; Thankachan SV; Aluru S
J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
[TBL] [Abstract][Full Text] [Related]
7. Efficient Minimum Flow Decomposition via Integer Linear Programming.
Dias FHC; Williams L; Mumey B; Tomescu AI
J Comput Biol; 2022 Nov; 29(11):1252-1267. PubMed ID: 36260412
[TBL] [Abstract][Full Text] [Related]
8. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
[TBL] [Abstract][Full Text] [Related]
9. Graph edit distance from spectral seriation.
Robles-Kelly A; Hancock ER
IEEE Trans Pattern Anal Mach Intell; 2005 Mar; 27(3):365-378. PubMed ID: 15747792
[TBL] [Abstract][Full Text] [Related]
10. Approximate Graph Edit Distance in Quadratic Time.
Riesen K; Ferrer M; Bunke H
IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
[TBL] [Abstract][Full Text] [Related]
11. A binary linear programming formulation of the graph edit distance.
Justice D; Hero A
IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857
[TBL] [Abstract][Full Text] [Related]
12. Parameterized Complexity of Eulerian Deletion Problems.
Cygan M; Marx D; Pilipczuk M; Pilipczuk M; Schlotter I
Algorithmica; 2014; 68(1):41-61. PubMed ID: 24415818
[TBL] [Abstract][Full Text] [Related]
13. Learning the Edit Costs of Graph Edit Distance Applied to Ligand-Based Virtual Screening.
Garcia-Hernandez C; Fernández A; Serratosa F
Curr Top Med Chem; 2020; 20(18):1582-1592. PubMed ID: 32493194
[TBL] [Abstract][Full Text] [Related]
14. A safety framework for flow decomposition problems via integer linear programming.
Dias FHC; Cáceres M; Williams L; Mumey B; Tomescu AI
Bioinformatics; 2023 Nov; 39(11):. PubMed ID: 37862229
[TBL] [Abstract][Full Text] [Related]
15. Constructing small genome graphs via string compression.
Qiu Y; Kingsford C
Bioinformatics; 2021 Jul; 37(Suppl_1):i205-i213. PubMed ID: 34252955
[TBL] [Abstract][Full Text] [Related]
16. Integration of string and de Bruijn graphs for genome assembly.
Huang YT; Liao CF
Bioinformatics; 2016 May; 32(9):1301-7. PubMed ID: 26755626
[TBL] [Abstract][Full Text] [Related]
17. Pan-genome de Bruijn graph using the bidirectional FM-index.
Depuydt L; Renders L; Abeel T; Fostier J
BMC Bioinformatics; 2023 Oct; 24(1):400. PubMed ID: 37884897
[TBL] [Abstract][Full Text] [Related]
18. A new graph model and algorithms for consistent superstring problems.
Na JC; Cho S; Choi S; Kim JW; Park K; Sim JS
Philos Trans A Math Phys Eng Sci; 2014 May; 372(2016):20130134. PubMed ID: 24751868
[TBL] [Abstract][Full Text] [Related]
19. RGFA: powerful and convenient handling of assembly graphs.
Gonnella G; Kurtz S
PeerJ; 2016; 4():e2681. PubMed ID: 27843717
[TBL] [Abstract][Full Text] [Related]
20. An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes.
Shao M; Lin Y; Moret BM
J Comput Biol; 2015 May; 22(5):425-35. PubMed ID: 25517208
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
