Abbas Nowzari-Dalini
机构: associate prof., university of tehran
每年引用次数
引用次数
引用: 1,564
H-指数: 17
I10-指数 : 26
出版物: 79
On the Solution of the Towers of Hanoi Problem
Hayedeh Ahrabian , Comfar Badamchi , Abbass Nowzari-Dalini
World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering 5 ( 1) 59 -62
2
2011
Generation of t-ary trees with Ballot-sequences*
H. Ahrabian , A. Nowzari-Dalini‡
International Journal of Computer Mathematics 80 ( 10) 1243 -1249
15
2003
A CONSTANT TIME ALGORITHM FOR DNA ADD
H. AHRABIAN , A. NOWZARI-DALINI , F. ZARE-MIRAKABAD
International Journal of Foundations of Computer Science 20 ( 03) 549 -558
2009
On the generation of binary trees in A-order
H. Ahrabian , A. Nowzari-dalini
International Journal of Computer Mathematics 71 ( 3) 351 -357
9
1999
A novel efficient dynamic programming algorithm for haplotype block partitioning
J. Zahiri , G. Mahdevar , A. Nowzari-dalini , H. Ahrabian
Journal of Theoretical Biology 267 ( 2) 164 -170
9
2010
A molecular algorithm for longest path problem
H Ahrabian , M Ganjtabesh , A Nowzari-Dalin
International Journal of Computer Information Systems and Industrial Management Applications 3 8 -8
1
2011
GENERATING BINARY TREES IN B-ORDER AND BALLOT-ORDER
H AHRABIAN , A NOWZARI-DALINI
نشریه علمی پژوهشی امیرکبیر 30 ( 2) 20 -20
2003
MOLECULAR SOLUTIONS FOR DOUBLE AND PARTIAL DIGEST PROBLEMS IN POLYNOMIAL TIME
Mohammad Ganjtabesh , Abbas Nowzari-Dalini , Hayedeh Ahrabian
Computing and Informatics \/ Computers and Artificial Intelligence 28 ( 5) 599 -618
1
2009
Ranking and Unranking Algorithms for k-ary Trees in Gray Code Order
Abbas Nowzari-Dalini , Fateme Ashari-Ghomi , Najme Khorasani
International Journal of Computer and Information Engineering 6 ( 8) 1020 -1025
1
2012
GENERATION OF BINARY TREES IN B-ORDER FROM (0-1) SEQUENCES
Abbas Nowzari-Dalini , Hayadeh Ahrabian
Malaysian Journal of Computer Science 17 ( 1) 24 -31
2004
Combining STDP and Reward-Modulated STDP in Deep Convolutional Spiking Neural Networks for Digit Recognition
Milad Mozafari , Mohammad Ganjtabesh , Abbas Nowzari-Dalini , Simon J Thorpe
50
2018
ParaKavosh: A Parallel Algorithm for Finding Biological Network Motifs
Abbas Nowzari-Dalini , Ali Masoudi-Nejad , Zahra Razaghi Moghadam Kashani
conference on information and knowledge technology 45 -49
2020
Network-based expression analysis reveals key genes related to glucocorticoid resistance in infant acute lymphoblastic leukemia.
Zaynab Mousavian , Abbas Nowzari-Dalini , Ronald W. Stam , Yasir Rahmatallah
Cellular Oncology 40 ( 1) 33 -45
11
2017
An Analytical RNA Secondary Structure Benchmark for the RNA Inverse Folding Problem
Javad Mohammadzadeh , Mohammad Ganjtabesh , Abbas Nowzari-Dalini
Current Bioinformatics 11 ( 5) 571 -577
2016
Differential network analysis and protein-protein interaction study reveals active protein modules in glucocorticoid resistance for infant acute lymphoblastic leukemia.
Zaynab Mousavian , Abbas Nowzari-Dalini , Yasir Rahmatallah , Ali Masoudi-Nejad
Molecular Medicine 25 ( 1) 36
2
2019
Mixture of feature specified experts
Saeed Reza Kheradpisheh , Fatemeh Sharifizadeh , Abbas Nowzari-Dalini , Mohammad Ganjtabesh
Information Fusion 20 242 -251
14
2014
First-Spike-Based Visual Categorization Using Reward-Modulated STDP
Milad Mozafari , Saeed Reza Kheradpisheh , Timothée Masquelier , Abbas Nowzari-Dalini
IEEE Transactions on Neural Networks 29 ( 12) 6178 -6190
135
2018
A parallel algorithm for generation of RNA secondary structures with length n and k base-pairs
Shahin Mohammadi , Abbas Nowzari-Dalini
Iran Journal of Computer Science 1 ( 1) 11 -17
2018
Appropriate time to apply control input to complex dynamical systems.
Ali Ebrahimi , Abbas Nowzari-Dalini , Mahdi Jalili , Ali Masoudi-Nejad
Scientific Reports 10 ( 1) 22035
2020
SpykeTorch: Efficient Simulation of Convolutional Spiking Neural Networks With at Most One Spike per Neuron.
Milad Mozafari , Mohammad Ganjtabesh , Abbas Nowzari-Dalini , Timothée Masquelier
Frontiers in Neuroscience 13 625
88
2019