Fast evaluation of sequence pair in block placement by longest common subsequence computation
Xiaoping Tang, Ruiqi Tian, Martin D. F. Wong · 2000
Article Free Access Share on Fast evaluation of sequence pair in block placement by longest common subsequence computation Authors: Xiaoping Tang Department of Computer Sciences, University of Texas at Austin Department of Computer Sciences, University of Texas at AustinView Profile , Ruiqi Tian Department of Computer Sciences, University of Texas at Austin and Motorola Computational Technology Lab, Austin, Texas Department of Computer Sciences, University of Texas at Austin and Motorola Computational Technology Lab, Austin, TexasView Profile , D. F. Wong Motorola Computational Technology Lab, Austin, Texas Motorola Computational Technology Lab, Austin, TexasView Profile Authors Info & Claims DATE '00: Proceedings of the conference on Design, automation and test in EuropeJanuary 2000 Pages 106–111https://doi.org/10.1145/343647.343713Online:01 January 2000Publication History 62citation483DownloadsMetricsTotal Citations62Total Downloads483Last 12 Months15Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF