default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGhada Hany Badr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j11]Ghada Hany Badr, Haifa A. Al-aqel:
DCJ-RNA - double cut and join for RNA secondary structures. BMC Bioinform. 18(S-12): 115-131 (2017)- 2016
- [c18]Ghada Badr, Manar Ibrahim Hosny
, Nuha Bintayyash, Eman Albilali, Souad Larabi Marie-Sainte:
BeamGA Median: A Hybrid Heuristic Search Framework. GECCO (Companion) 2016: 1455-1456 - 2015
- [j10]Hala M. Alshamlan, Ghada Hany Badr, Yousef A. Alohali:
Genetic Bee Colony (GBC) algorithm: A new gene selection method for microarray cancer classification. Comput. Biol. Chem. 56: 49-60 (2015) - [j9]Isra Al-Turaiki, Ghada Badr, Hassan Mathkour:
TrieAMD: a scalable and efficient apriori motif discovery approach. Int. J. Data Min. Bioinform. 13(1): 13-30 (2015) - [c17]Hala M. Alshamlan, Ghada Badr, Yousef A. Alohali:
Microarray Gene Selection and Cancer Classification Method Using Artificial Bee Colony and SVM Algorithms (ABC-SVM). DaEng 2015: 575-584 - [c16]Hala M. Alshamlan, Ghada Badr, Yousef A. Alohali:
A Comparative Study of Gene Selection Methods for Microarray Cancer Classification. DaEng 2015: 585-595 - [c15]Amani Al-Ajlan, Ghada Badr:
Data Mining in Pathway Analysis for Gene Expression. ICDM 2015: 69-77 - [c14]Nada AlZahrani, Rasha Alsulim, Nourah Alaseem, Ghada Badr:
Data Analysis for Courses Registration. MLDM 2015: 357-367 - [c13]Mona Al-Saleem, Norah Al-Kathiry, Sara Al-Osimi, Ghada Badr:
Mining Educational Data to Predict Students' Academic Performance. MLDM 2015: 403-414 - 2014
- [j8]Ghada Hany Badr, Isra Al-Turaiki, Marcel Turcotte, Hassan Mathkour:
IncMD: Incremental trie-based structural motif discovery algorithm. J. Bioinform. Comput. Biol. 12(5) (2014) - [c12]Najlaa AlHuwaishel, Maram AlAlwan, Ghada Badr:
Finding the Frequent Pattern in a Database - A Study on the Apriori Algorithm. KDIR 2014: 388-396 - 2013
- [j7]Ghada Badr, Isra Al-Turaiki, Hassan Mathkour:
Classification and assessment tools for structural motif discovery algorithms. BMC Bioinform. 14(S-9): S4 (2013) - [c11]Hala M. Alshamlan, Ghada Badr, Yousef A. Alohali:
A Comparative Study of Cancer Classification Methods Using Microarray Gene Expression Profile. DaEng 2013: 389-398 - 2012
- [c10]Isra Al-Turaiki, Ghada Badr, Hassan Mathkour:
Trie-based Apriori Motif Discovery Approach. ISBRA 2012: 1-12 - 2011
- [j6]Krister M. Swenson, Ghada Badr, David Sankoff:
Listing all sorting reversals in quadratic time. Algorithms Mol. Biol. 6: 11 (2011) - [j5]Ghada Badr, Krister M. Swenson, David Sankoff:
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives. J. Comput. Biol. 18(9): 1201-1210 (2011) - [c9]Ghada Badr, Marcel Turcotte:
Component-Based Matching for Multiple Interacting RNA Sequences. ISBRA 2011: 73-86 - 2010
- [c8]Ghada Badr, Krister M. Swenson, David Sankoff:
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives. RECOMB-CG 2010: 39-49 - [c7]Krister M. Swenson, Ghada Badr, David Sankoff:
Listing All Sorting Reversals in Quadratic Time. WABI 2010: 102-110
2000 – 2009
- 2008
- [p1]Ghada Badr, Eric Joanis, Samuel Larkin, Roland Kuhn:
Manageable Phrase-Based Statistical Machine Translation Models. Computer Recognition Systems 2 2008: 437-444 - 2007
- [j4]B. John Oommen, Ghada Hany Badr:
Breadth-first search strategies for trie-based syntactic pattern recognition. Pattern Anal. Appl. 10(1): 1-13 (2007) - [c6]Ghada Hany Badr:
Optimized Similarity Measure Over Trie. MLDM Posters 2007: 236-150 - 2006
- [j3]Ghada Badr, B. John Oommen:
A novel look-ahead optimization strategy for trie-based approximate string matching. Pattern Anal. Appl. 9(2-3): 177-187 (2006) - [j2]Ghada Badr, B. John Oommen:
On optimizing syntactic pattern recognition using tries and AI-based heuristic-search strategies. IEEE Trans. Syst. Man Cybern. Part B 36(3): 611-622 (2006) - 2005
- [j1]Ghada Hany Badr, B. John Oommen:
Self-Adjusting of Ternary Search Tries Using Conditional Rotations and Randomized Heuristics. Comput. J. 48(2): 200-219 (2005) - [c5]Ghada Badr, B. John Oommen:
On using conditional rotations and randomized heuristics for self-organizing ternary search tries. ACM Southeast Regional Conference (1) 2005: 109-115 - [c4]Ghada Badr, B. John Oommen:
A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching. CORES 2005: 87-94 - [c3]Ghada Badr, B. John Oommen:
Enhancing Trie-Based Syntactic Pattern Recognition Using AI Heuristic Search Strategies. ICAPR (1) 2005: 1-17 - 2004
- [c2]B. John Oommen, Ghada Badr:
Dictionary-Based Syntactic Pattern Recognition Using Tries. SSPR/SPR 2004: 251-259
1990 – 1999
- 1997
- [c1]Amani A. Saad, Ghada Badr:
The ALEX Object Manager. ISCC 1997: 200-204
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-10-07 21:19 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:
