| |
|
|
|
Registro Completo |
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
12/08/2002 |
|
Data da última atualização: |
11/12/2007 |
|
Autoria: |
INTERNATIONAL WORKSHOP, 1., 2001, Arhus Denmark. |
|
Título: |
Algorithms in bioinformatics: proceedings. |
|
Ano de publicação: |
2001 |
|
Fonte/Imprenta: |
Berlin: Springer, 2001. |
|
Páginas: |
306 p. |
|
Série: |
(Lecture Notes in Computer Science, 2149). |
|
ISBN: |
3-540-42516-0 |
|
Idioma: |
Inglês |
|
Notas: |
Editado por Olivier Gascuel, Bernard M. E. Moret |
|
Conteúdo: |
An improved model for statistical alignment (I. Miklós, Z. Toroczkai). Improving profile-profile alignments via log average scoring (N. von ohsen, R. Zimmer). False positive s in genomic map assembly and sequence validation (T. Anantharaman, B. Mishra). Boosting EM for radiation hybrid and genetic mapping (T. Schiex, P. Chabrier, M. Bouchez, D. Milan). Placing probes along the genome using pairwise distance data (W. Casey, B. Mishra, M. Wigler). Comparing a Hidden Markov model and a stochastic context-free grammar (A. Jagota, R. B. Lyngso, C. N. S. Pedersen). Assessing the statistical significance of overrepresented oligonucleotides (A. Denise, M. Régnier, M. vandenbogaert). Pattern matching and pattern discovery algorithms for protein topologies (J. Viksna, D. Gilbert). Computing linking numbers of a filtration (H. Edelsbrusnner, A. Zomorodian). Side chain-positioning as an integer programming problem (O. Eriksson, Y. Zhou, A. Elofsson). A chemical-distance-based test for positive darwinian selection (T. Pupko, R. Sharan, M. Hasegawa, R. Shamir, D. Graur). Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynominal time (G. Ganapathysaravanabavan, T. Warnow). Experiments in computing sequences of reversals (A. Bergeron, François Strasbourg). Exact-IEBP: a new technique for estimating evolutionary distances between whole genomes (Li-San Wang). Finding an optimal inversion median: experimental results (A. C. Siepel, B. M. E. Moret). Analytic solutions for three-taxon MLMC trees with variable rates across sites (B. Chor, M. Hendy, D. Penny). The performance of phylogenetic methods on trees of bounded diameter (L. nakhleh, U. Roshan, K. St. John, J. Sun, T. Warnow). (1+E)- approximation of sorting by reversals and transpositions (N. Eriksen). On the practical solution of the reversal median problem (A. Caprara). Algorithms for finding gene clusters (S. Heber, J. Stoye). Determination of binding amino acids based on random peptide array screening data (P. J. van der Veen, L. F. A. Wessels, J. W. Sloostra, R. H. Meloen, M. J. T. Reinders, J. Hellendoorn). A simple hyper-geometric approach for discovering putative transcription factor binding sites (Y. Barash, G. Bejerano, N. Friedman). Comparing assemblies using fragments and mate-pairs (D. H. Huson, A. L. Halpern, Z. Lai, E. W. myers, K. Reinert, G. G. Sutton). Author index. MenosAn improved model for statistical alignment (I. Miklós, Z. Toroczkai). Improving profile-profile alignments via log average scoring (N. von ohsen, R. Zimmer). False positive s in genomic map assembly and sequence validation (T. Anantharaman, B. Mishra). Boosting EM for radiation hybrid and genetic mapping (T. Schiex, P. Chabrier, M. Bouchez, D. Milan). Placing probes along the genome using pairwise distance data (W. Casey, B. Mishra, M. Wigler). Comparing a Hidden Markov model and a stochastic context-free grammar (A. Jagota, R. B. Lyngso, C. N. S. Pedersen). Assessing the statistical significance of overrepresented oligonucleotides (A. Denise, M. Régnier, M. vandenbogaert). Pattern matching and pattern discovery algorithms for protein topologies (J. Viksna, D. Gilbert). Computing linking numbers of a filtration (H. Edelsbrusnner, A. Zomorodian). Side chain-positioning as an integer programming problem (O. Eriksson, Y. Zhou, A. Elofsson). A chemical-distance-based test for positive darwinian selection (T. Pupko, R. Sharan, M. Hasegawa, R. Shamir, D. Graur). Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynominal time (G. Ganapathysaravanabavan, T. Warnow). Experiments in computing sequences of reversals (A. Bergeron, François Strasbourg). Exact-IEBP: a new technique for estimating evolutionary distances between whole genomes (Li-San Wang). Finding an optimal inversion median: experimental results (A. C. Siepel, B. M. E. ... Mostrar Tudo |
|
Palavras-Chave: |
Algoritmo; Bioinformática; Modelo estatístico. |
|
Thesagro: |
Estatística; Genoma. |
|
Categoria do assunto: |
-- |
|
Marc: |
LEADER 03041nam a2200217 a 4500
001 1008187
005 2007-12-11
008 2001 bl uuuu u01u1 u #d
020 $a3-540-42516-0
100 1 $aINTERNATIONAL WORKSHOP, 1., 2001, Arhus Denmark.
245 $aAlgorithms in bioinformatics$bproceedings.
260 $aBerlin: Springer$c2001
300 $a306 p.
490 $a(Lecture Notes in Computer Science, 2149).
500 $aEditado por Olivier Gascuel, Bernard M. E. Moret
520 $aAn improved model for statistical alignment (I. Miklós, Z. Toroczkai). Improving profile-profile alignments via log average scoring (N. von ohsen, R. Zimmer). False positive s in genomic map assembly and sequence validation (T. Anantharaman, B. Mishra). Boosting EM for radiation hybrid and genetic mapping (T. Schiex, P. Chabrier, M. Bouchez, D. Milan). Placing probes along the genome using pairwise distance data (W. Casey, B. Mishra, M. Wigler). Comparing a Hidden Markov model and a stochastic context-free grammar (A. Jagota, R. B. Lyngso, C. N. S. Pedersen). Assessing the statistical significance of overrepresented oligonucleotides (A. Denise, M. Régnier, M. vandenbogaert). Pattern matching and pattern discovery algorithms for protein topologies (J. Viksna, D. Gilbert). Computing linking numbers of a filtration (H. Edelsbrusnner, A. Zomorodian). Side chain-positioning as an integer programming problem (O. Eriksson, Y. Zhou, A. Elofsson). A chemical-distance-based test for positive darwinian selection (T. Pupko, R. Sharan, M. Hasegawa, R. Shamir, D. Graur). Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynominal time (G. Ganapathysaravanabavan, T. Warnow). Experiments in computing sequences of reversals (A. Bergeron, François Strasbourg). Exact-IEBP: a new technique for estimating evolutionary distances between whole genomes (Li-San Wang). Finding an optimal inversion median: experimental results (A. C. Siepel, B. M. E. Moret). Analytic solutions for three-taxon MLMC trees with variable rates across sites (B. Chor, M. Hendy, D. Penny). The performance of phylogenetic methods on trees of bounded diameter (L. nakhleh, U. Roshan, K. St. John, J. Sun, T. Warnow). (1+E)- approximation of sorting by reversals and transpositions (N. Eriksen). On the practical solution of the reversal median problem (A. Caprara). Algorithms for finding gene clusters (S. Heber, J. Stoye). Determination of binding amino acids based on random peptide array screening data (P. J. van der Veen, L. F. A. Wessels, J. W. Sloostra, R. H. Meloen, M. J. T. Reinders, J. Hellendoorn). A simple hyper-geometric approach for discovering putative transcription factor binding sites (Y. Barash, G. Bejerano, N. Friedman). Comparing assemblies using fragments and mate-pairs (D. H. Huson, A. L. Halpern, Z. Lai, E. W. myers, K. Reinert, G. G. Sutton). Author index.
650 $aEstatística
650 $aGenoma
653 $aAlgoritmo
653 $aBioinformática
653 $aModelo estatístico
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
URL |
Voltar
|
|
|
| Registros recuperados : 1 | |
| 1. |  | ROQUE, N.; NAKAJIMA, J.; HEIDEN, G.; MONGE, M.; RITTER, M. R.; LOEUILLE, B. F. P.; CHRIST, A. L.; REBOUÇAS, N. C.; CASTRO, M. S.; SAAVEDRA, M. M.; TELES, A. M.; GANDARA, A.; MARQUES, D.; BRINGEL JR. J. B. A.; ANGULO, M. B.; SANTOS, J. U. M. D.; SOUZA-BUTURI, F. O.; ALVES, M.; SANCHO, G.; REIS-SILVA, G. A.; VOLET, D. P.; HATTORI, E. K. O.; PLOS, A.; SIMÃO-BIANCHINI, R.; RIVERA, V. L.; MAGENTA, M. A. G.; ABREU, V. H. R.; GROSSI, M. A.; AMORIM, V. O.; SCHNEIDER, A. A.; CARNEIRO, C. R.; BORGES, R. A. X.; SINISCALCHI, C. M.; BUENO, V. R.; VIA DO PICO, G. M.; ALMEIDA, G. S. S.; FREITAS, F. S.; DEBLE, L. P.; MOREIRA, G. L.; CONTRO, F. L.; GUTIÉRREZ, D. G.; SOUZA-SOUZA, R. M. B.; VIERA BARRETO, J. N.; SOARES, P. N.; QUARESMA, A. S.; PICANÇO, W. L.; FERNANDES, F.; MONDIN, C. A.; SALGADO, V. G.; KILIPPER, J. T.; FARCO, G. E.; RIBEIRO, R. N.; WALTER, B. M. T.; LORENCINI, T. S.; FERNANDES, A. C.; SILVA, L. N.; BARCELOS, L. B.; BARBOSA, M. L.; BAUTISTA, H. P.; CALVO, J.; DEMATTEIS, M.; FERREIRA, S. C.; HIRIART, F. D.; MORAES, M. D.; SEMIR, J. Asteraceae. In: FLORA do Brasil 2020. Rio de Janeiro: Jardim Botânico, [2021].| Tipo: Capítulo em Livro Técnico-Científico |
| Biblioteca(s): Embrapa Recursos Genéticos e Biotecnologia. |
|    |
| Registros recuperados : 1 | |
|
| Nenhum registro encontrado para a expressão de busca informada. |
|
|
