default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaydeh Ahrabian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j17]Mahdi Amani, Abbas Nowzari-Dalini, Hayedeh Ahrabian:
Generation of Neuronal Trees by a New Three Letters Encoding. Comput. Informatics 33(6): 1428-1450 (2014)- 2013
- [j16]Hayedeh Ahrabian, Mohammad Ganjtabesh, Abbas Nowzari-Dalini, Zahra Razaghi Moghadam Kashani:
Genetic algorithm solution for partial digest problem. Int. J. Bioinform. Res. Appl. 9(6): 584-594 (2013) - 2011
- [j15]Amin Ahmadi-Adl, Abbas Nowzari-Dalini, Hayedeh Ahrabian:
Ranking and unranking algorithms for loopless generation of t-ary trees. Log. J. IGPL 19(1): 33-43 (2011) - 2010
- [j14]E. Seyedi-Tabari, Haydeh Ahrabian, Abbas Nowzari-Dalini:
A new algorithm for generation of different types of RNA. Int. J. Comput. Math. 87(6): 1197-1207 (2010) - [j13]Ghasem Mahdevar
, Javad Zahiri, Mehdi Sadeghi, Abbas Nowzari-Dalini, Hayedeh Ahrabian:
Tag SNP selection via a genetic algorithm. J. Biomed. Informatics 43(5): 800-804 (2010)
2000 – 2009
- 2009
- [j12]Zahra Razaghi Moghadam Kashani, Hayedeh Ahrabian, Elahe Elahi, Abbas Nowzari-Dalini, Elnaz Saberi Ansari, Sahar Asadi, Shahin Mohammadi, Falk Schreiber, Ali Masoudi-Nejad:
Kavosh: a new algorithm for finding network motifs. BMC Bioinform. 10: 318 (2009) - [j11]Fatemeh Zare-Mirakabad, Hayedeh Ahrabian, Mehdi Sadeghi, Abbas Nowzari-Dalini, Bahram Goliaei:
New scoring schema for finding motifs in DNA Sequences. BMC Bioinform. 10 (2009) - [j10]Mohammad Ganjtabesh, Haydeh Ahrabian, Abbas Nowzari-Dalini:
Molecular solutions for double and partial digest problems in polynomial time. Comput. Informatics 28(5): 599-618 (2009) - [j9]Haydeh Ahrabian, Abbas Nowzari-Dalini, Fatemeh Zare-Mirakabad:
A Constant Time Algorithm for DNA Add. Int. J. Found. Comput. Sci. 20(3): 549-558 (2009) - 2008
- [j8]Haydeh Ahrabian, Abdolreza Mirzaei, Abbas Nowzari-Dalini:
A DNA Sticker Algorithm for Solving N-Queen Problem. Int. J. Comput. Sci. Appl. 5(2): 12-22 (2008) - 2007
- [j7]Haydeh Ahrabian, Abbas Nowzari-Dalini:
Parallel Generation of t-Ary Trees in A-order. Comput. J. 50(5): 581-588 (2007) - 2006
- [j6]Abbas Nowzari-Dalini, Elahe Elahi, Haydeh Ahrabian, M. Ronaghi:
A New DNA Implementation of Finite State Machines. Int. J. Comput. Sci. Appl. 3(1): 51-60 (2006) - 2005
- [j5]Haydeh Ahrabian, Abbas Nowzari-Dalini:
Parallel generation of binary trees in A-order. Parallel Comput. 31(8-9): 948-955 (2005) - 2003
- [j4]Haydeh Ahrabian, Abbas Nowzari-Dalini:
Generation of t-ary trees with Ballot-sequences. Int. J. Comput. Math. 80(10): 1243-1249 (2003) - 2002
- [j3]Haydeh Ahrabian, Abbas Nowzari-Dalini:
Parallel Algorithms for Minimum Spanning Tree Problem. Int. J. Comput. Math. 79(4): 441-448 (2002)
1990 – 1999
- 1999
- [j2]Haydeh Ahrabian, Abbas Nowzari-Dalini:
On the generation of binary trees in A-order. Int. J. Comput. Math. 71(3): 351-357 (1999) - 1998
- [j1]Haydeh Ahrabian, Abbas Nowzari-Dalini:
On the generation of binary trees from (0-1) codes. Int. J. Comput. Math. 69(3-4): 243-251 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 00:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
