Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions.

Tzvika Hartman|Elad Verbin


Anthology ID:DBLP:conf/spire/HartmanV06
Volume:String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings
Year:2006
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:279-290
URL:https://doi.org/10.1007/11880561_23
DOI:https://doi.org/10.1007/11880561_23
DBLP:conf/spire/HartmanV06
BibTeX:
@inproceedings{hartman-2006-matrix, author = {Tzvika Hartman and Elad Verbin}, editor = {Fabio Crestani and Paolo Ferragina and Mark Sanderson}, title = {{Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions}}, booktitle = {{String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {4209}, pages = {279--290}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11880561_23}, doi = {https://doi.org/10.1007/11880561_23} }