default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaid Sadique Adi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j7]Leandro Ishi Soares de Lima, Said Sadique Adi:
The Chain Alignment Problem. J. Comput. Sci. 45: 101161 (2020)- 2018
- [j6]Jean Alexandre Dobre, Said Sadique Adi:
Um sistema para auxiliar na seleção de regiões específicas de sequências biológicas. Braz. J. Inf. Syst. 11(3): 127-151 (2018) - 2013
- [j5]Said Sadique Adi, Carlos Eduardo Ferreira:
Syntenic global alignment and its application to the gene prediction problem. J. Braz. Comput. Soc. 19(4): 511-521 (2013) - 2010
- [j4]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes
, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi:
Repetition-free longest common subsequence. Discret. Appl. Math. 158(12): 1315-1324 (2010) - 2008
- [j3]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi:
Repetition-free longest common subsequence. Electron. Notes Discret. Math. 30: 243-248 (2008) - 2005
- [j2]Said Sadique Adi, Carlos Eduardo Ferreira:
Gene prediction by multiple syntenic alignment. J. Integr. Bioinform. 2(1) (2005) - 2001
- [j1]Said Sadique Adi, Carlos Eduardo Ferreira:
DNA Fragments Assembly Programs: a comparative study. Electron. Notes Discret. Math. 7: 158-161 (2001)
Conference and Workshop Papers
- 2023
- [c8]Lucas B. Rocha, Said Sadique Adi, Eloi Araujo:
Heuristics for the de Bruijn Graph Sequence Mapping Problem. ICCSA (1) 2023: 152-169 - 2019
- [c7]Lucas B. Rocha, Said Sadique Adi, Marco Aurelio Stefanes, Eloi Araujo:
Heuristics for the Specific Substring Problem with Hamming Distance. BIBE 2019: 250-257 - [c6]Leandro Ishi Soares de Lima, Said Sadique Adi:
The Chain Alignment Problem. ICCS (3) 2019: 17-30 - 2015
- [c5]Alex Z. Zaccaron, Said Sadique Adi, Carlos H. A. Higa, Eloi Araujo, Burton H. Bluhm:
The Maximum Similarity Partitioning Problem and its Application in the Transcriptome Reconstruction and Quantification Problem. ICCSA (1) 2015: 257-266 - 2014
- [c4]Regina Beretta Mazaro, Leandro Ishi Soares de Lima, Said Sadique Adi:
A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction Task. SPIRE 2014: 129-138 - 2011
- [c3]Rodrigo Mitsuo Kishi, Ronaldo Fiorilo dos Santos, Said Sadique Adi:
Gene Prediction by Multiple Spliced Alignment. BSB 2011: 26-33 - 2007
- [c2]Nalvo F. Almeida, André C. Lima, Said Sadique Adi, Carlos Juliano M. Viana, Marcel Y. Nakazaki, Andrey A. Tamura, Luciana Y. Hiratsuka, Leandro P. Brazil:
Mapping Contigs onto Reference Genomes. BSB 2007: 153-157 - 2005
- [c1]Said Sadique Adi, Carlos Eduardo Ferreira:
Gene Prediction by Syntenic Alignment. BSB 2005: 246-250
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-04-24 23:03 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:
