282 related articles for article (PubMed ID: 29994050)
1. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
[TBL] [Abstract][Full Text] [Related]
2. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
Shimizu M; Nagamochi H; Akutsu T
BMC Bioinformatics; 2011 Dec; 12 Suppl 14(Suppl 14):S3. PubMed ID: 22373441
[TBL] [Abstract][Full Text] [Related]
3. Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
Ishida Y; Zhao L; Nagamochi H; Akutsu T
Genome Inform; 2008; 21():53-64. PubMed ID: 19425147
[TBL] [Abstract][Full Text] [Related]
4. Efficient enumeration of monocyclic chemical graphs with given path frequencies.
Suzuki M; Nagamochi H; Akutsu T
J Cheminform; 2014; 6():31. PubMed ID: 24955135
[TBL] [Abstract][Full Text] [Related]
5. Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut.
Ishida Y; Kato Y; Zhao L; Nagamochi H; Akutsu T
J Chem Inf Model; 2010 May; 50(5):934-46. PubMed ID: 20415496
[TBL] [Abstract][Full Text] [Related]
6. Detecting list-colored graph motifs in biological networks using branch-and-bound strategy.
Huang Y; Zhong C
Comput Biol Med; 2019 Apr; 107():1-9. PubMed ID: 30738296
[TBL] [Abstract][Full Text] [Related]
7. Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs.
Li J; Nagamochi H; Akutsu T
IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):633-646. PubMed ID: 28113952
[TBL] [Abstract][Full Text] [Related]
8. Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming.
Imada T; Ota S; Nagamochi H; Akutsu T
J Chem Inf Model; 2011 Nov; 51(11):2788-807. PubMed ID: 21848281
[TBL] [Abstract][Full Text] [Related]
9. RANGI: a fast list-colored graph motif finding algorithm.
Rudi AG; Shahrivari S; Jalili S; Moghadam Kashani ZR
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(2):504-13. PubMed ID: 23929873
[TBL] [Abstract][Full Text] [Related]
10. Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank.
Azam NA; Shurbevski A; Nagamochi H
Entropy (Basel); 2020 Nov; 22(11):. PubMed ID: 33287063
[TBL] [Abstract][Full Text] [Related]
11. An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
Azam NA; Shurbevski A; Nagamochi H
Entropy (Basel); 2020 Aug; 22(9):. PubMed ID: 33286692
[TBL] [Abstract][Full Text] [Related]
12. Subgraph queries by context-free grammars.
Sevon P; Eronen L
J Integr Bioinform; 2008 Aug; 5(2):. PubMed ID: 20134073
[TBL] [Abstract][Full Text] [Related]
13. CeFunMO: A centrality based method for discovering functional motifs with application in biological networks.
Kouhsar M; Razaghi-Moghadam Z; Mousavian Z; Masoudi-Nejad A
Comput Biol Med; 2016 Sep; 76():154-9. PubMed ID: 27454243
[TBL] [Abstract][Full Text] [Related]
14. On the Extremal Wiener Polarity Index of Hückel Graphs.
Wang H
Comput Math Methods Med; 2016; 2016():3873597. PubMed ID: 27247613
[TBL] [Abstract][Full Text] [Related]
15. A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
Zhu J; Azam NA; Zhang F; Shurbevski A; Haraguchi K; Zhao L; Nagamochi H; Akutsu T
IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3233-3245. PubMed ID: 34520360
[TBL] [Abstract][Full Text] [Related]
16. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.
Jain S; Saju S; Petingi L; Schlick T
Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508
[TBL] [Abstract][Full Text] [Related]
17. Enumerating treelike chemical graphs with given path frequency.
Fujiwara H; Wang J; Zhao L; Nagamochi H; Akutsu T
J Chem Inf Model; 2008 Jul; 48(7):1345-57. PubMed ID: 18588284
[TBL] [Abstract][Full Text] [Related]
18. A linear delay algorithm for enumerating all connected induced subgraphs.
Alokshiya M; Salem S; Abed F
BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984
[TBL] [Abstract][Full Text] [Related]
19. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
Fujita M; Shimada Y; Kimura T; Ikeguchi T
PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
[TBL] [Abstract][Full Text] [Related]
20. Breadth-first search approach to enumeration of tree-like chemical compounds.
Zhao Y; Hayashida M; Jindalertudomdee J; Nagamochi H; Akutsu T
J Bioinform Comput Biol; 2013 Dec; 11(6):1343007. PubMed ID: 24372036
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
