Journal of symbolic computation

• 

  Año 2006, Vol. 41, Número 2

  • Preface

    Serkan Hosten, Christopher Meek

    págs. 123-124

    

  • Resultants in genetic linkage analysis

    Bernd Sturmfels, Ingileif B. Hallgrímsdóttir

    • Resumen

    págs. 125-137

    

  • Phylogenetic invariants for stationary base composition

    Elizabeth S. Allman, John A. Rhodes

    • Resumen

    págs. 138-150

    

  • Viterbi sequences and polytopes

    Eric H. Kuo

    • Resumen

    págs. 151-163

    

  • Markov bases and structural zeros

    Fabio Rapallo

    • Resumen

    págs. 164-172

    

  • Markov bases of three-way tables are arbitrarily complicated

    Jesús A. de Loera, Shmuel Onn

    • Resumen

    págs. 173-181

    

  • Markov bases for noncommutative Fourier analysis of ranked data

    Persi Diaconis, Nicholas Eriksson

    • Resumen

    págs. 182-195

    

  • The space of compatible full conditionals is a unimodular toric variety

    Aleksandra B. Slavkovic, Seth Sullivant

    • Resumen

    págs. 196-209

    

  • Cumulant varieties

    Giovanni Pistone, Henry P. Wynn

    • Resumen

    págs. 210-221

    

  • Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models

    Nicholas Eriksson, Alessandro Rinaldo, Stephen E. Fienberg, Seth Sullivant

    • Resumen

    págs. 222-233

    

  • Counting and locating the solutions of polynomial systems of maximum likelihood equations, I

    Max-Louis G. Buot, Donald St. P. Richards

    • Resumen

    págs. 234-244

    

  • Computing all roots of the likelihood equations of seemingly unrelated regressions

    Mathias Drton

    • Resumen

    págs. 245-254