Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Said Sadique Adi"'
Autor:
Said Sadique Adi
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USPUniversidade de São PauloUSP.
Atualmente, existe um grande número de ferramentas para montagem de fragmentos de DNA disponíveis. Neste trabalho apresentamos um estudo comparativo das ferramentas CAP2, FAKtory, TIGR e PHRAP. Para realizarmos este estudo, primeiramente executamos
An important problem in Computational Biology is to map a sequencesinto a sequence graphGand one way to achieve this goal is to find a walkpinGsuch thatpspells a sequences′most similar tos. This problem is known as Graph Sequence Mapping Problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c9788dccf29ea5be072a5ceef2fb9b3
https://doi.org/10.1101/2023.02.05.527069
https://doi.org/10.1101/2023.02.05.527069
Autor:
Said Sadique Adi
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USP
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Com os avanços das técnicas de sequenciamento das moléculas de DNA, nos deparamos atualmente com um número expressivo de seqüências genômicas a serem analisadas. Dentre as várias informações de interesse guardadas em uma seqüência desse t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0fd4e1157a4351bbf81e8a2e44c7c978
https://doi.org/10.11606/t.45.2005.tde-20210729-141959
https://doi.org/10.11606/t.45.2005.tde-20210729-141959
Publikováno v:
BIBE
An important problem in Computational Biology is to determine genetic markers, substrings of a set of sequences that do not occur on sequences of other sets. Applications for this problem include finding small specific regions for primer design and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02330004c12484bf13f64e9ee46b5785
https://doi.org/10.1109/bibe.2019.00052
https://doi.org/10.1109/bibe.2019.00052
Autor:
Leandro Lima, Said Sadique Adi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030227432
ICCS (3)
ICCS (3)
This paper introduces two new combinatorial optimization problems involving strings, namely, the Open image in new window , and a multiple version of it, the Open image in new window . For the first problem, a polynomial-time algorithm using dynamic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11a2d5af198ff1d286a8ce23ee7c9175
https://doi.org/10.1007/978-3-030-22744-9_2
https://doi.org/10.1007/978-3-030-22744-9_2
Autor:
Leandro Lima, Said Sadique Adi
Publikováno v:
Journal of Computational Science. 45:101161
This paper introduces two new combinatorial optimization problems involving strings, namely, the Open image in new window , and a multiple version of it, the Open image in new window . For the first problem, a polynomial-time algorithm using dynamic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d96b98ac239bffbe9403951f0bf6747
https://doi.org/10.1016/j.jocs.2020.101161
https://doi.org/10.1016/j.jocs.2020.101161
Publikováno v:
Anais Estendidos do XI Simpósio Brasileiro de Bioinformática (BSB Estendido 2018).
Given two sets of sequences A and B, the Substring Specific problem is to find all minimum substrings in A having distance at least k for each subsequence in B. This work addresses three new implementations for the Maaß algorithm when the Hamming di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d17bcf833b5afbcee51462e06fa43025
https://doi.org/10.5753/bsb_estendido.2018.8801
https://doi.org/10.5753/bsb_estendido.2018.8801
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Given the increasing number of available genomic sequences, one now faces the task of identifying their protein coding regions. The gene prediction problem can be addressed in several ways, and one of the most promising methods makes use of informati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e72c07836cb6f9a63fc2df6f4c6d8c3e
https://doi.org/10.1007/s13173-013-0115-9
https://doi.org/10.1007/s13173-013-0115-9
Autor:
Stenio Perdigão Fragoso, Gisele Bacanelli, G. M. S. Rosinha, Luciana M Cheung, Carlos Alberto do Nascimento Ramos, Daniel da Silva Guedes Junior, Said Sadique Adi, Nalvo F Almeida Junior, Adivaldo Henrique da Fonseca, Renato H.M. Oliveira, Caroline Spitz dos Santos, Cleber O. Soares, Flábio R. Araújo
Publikováno v:
Memórias do Instituto Oswaldo Cruz, Volume: 105, Issue: 7, Pages: 843-849, Published: NOV 2010
Memórias do Instituto Oswaldo Cruz., Vol 105, Iss 7, Pp 843-849 (2010)
Memórias do Instituto Oswaldo Cruz., Vol 105, Iss 7, Pp 843-849 (2010)
The sequencing of the complete genome of Anaplasma marginale has enabled the identification of several genes that encode membrane proteins, thereby increasing the chances of identifying candidate immunogens. Little is known regarding the genetic vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ee4af7de32adae642eb20bd66eea385
https://doi.org/10.1590/s0074-02762010000700001
https://doi.org/10.1590/s0074-02762010000700001
Autor:
Carlos Eduardo Ferreira, Marco A. Stefanes, Marília D. V. Braga, Cristina G. Fernandes, Said Sadique Adi, Christian Tjandraatmadja, Fábio Viduani Martinez, Marie-France Sagot, Yoshiko Wakabayashi
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2010, 158 (12), pp.1315-1324. ⟨10.1016/j.dam.2009.04.023⟩
Discrete Applied Mathematics, Elsevier, 2010, 158(12), pp.1315-1324
Electronic Notes in Discrete Mathematics
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Nov 2007, Puerto Varas, Chile. pp.243-248, ⟨10.1016/j.endm.2008.01.042⟩
Discrete Applied Mathematics, 2010, 158 (12), pp.1315-1324. ⟨10.1016/j.dam.2009.04.023⟩
Discrete Applied Mathematics, Elsevier, 2010, 158(12), pp.1315-1324
Electronic Notes in Discrete Mathematics
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Nov 2007, Puerto Varas, Chile. pp.243-248, ⟨10.1016/j.endm.2008.01.042⟩
We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and we describe a preliminary ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3006a612503938efdbb5f50d1370f9e
https://doi.org/10.1016/j.dam.2009.04.023
https://doi.org/10.1016/j.dam.2009.04.023